#1
| |||
| |||
![]()
I am looking for the Persistent Company Placement examination question Paper, give me soon ? Here I am giving you Persistent Company Placement exam question Paper in word file attached with it so you can get it easily.. Some questions are given below : 2)On which maximum operations cannot be performed .Something like that a)Array b)Hash Table c)Linked List d)Heap e)Binary Tree 3)A hash table has a sie of 11 and data filled in its position like{3,5,7,9,6}how many comparisons have to be made if data is not found in the list in worst case a) 2 b) 6 c) 11 d) ANS:- 2 4)Forest with n Trees and having p edges then a)n(1-p) b) n = p +2 c) n-p+1 d) e) 5)Find the shortest path from B to E ANS: 7 one Question on Postfix. 2ndSECTION (C LANGAUGE) 1) what is int(*(*ptr (int))(void) a)Pointer to function with no arguments(void) and return pointer to integer. b)---- c) 5)A tree was given with nodes assigned clours red, blue, yellow, green and more that one node is having colour red.They have asked that how many times the output will be red if the total number of evaluation is 11. some code was given--I don't remember that. 3rd Section(O.S) 1) If there are n proceses and each process waits p time in waiting state then cpu utilization is-: a) n(1-p) b) n*p 2)No. of pages are given and using LRU algorithm we have to find the number of page faults. a)2 b)6 c)5 d)7 3)There is a file server which provides locking for mutual exclusion . if any procees locks the file and abruptly terminated this will result in indefinitely locking .The solution they found is to implement a timer for locking of file i.e. if time outs then server assumes that file is indefinitely locked and terminate the process – a) this solution is perfect for mutual exclausion b) this will solve indefinite locking c) this will result in interleaving of file between processes d) will allow the concurrent process to access the file. 4)A critical Section is a)for mutual exclusion b)a set of shared resources c) d) 5)Match the following. 1)Critical Section a)Mutual exclusion 2)Wait/signal b)Deadlock 3)Working set c)Hoare's Monitor 4)Semaphore d Last edited by Aakashd; May 29th, 2019 at 10:07 AM. |