Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution.   Allocation Max   X Y Z X Y Z P0 0 0 1 8 4 3 P1 3 2 0 6 2 0 P2 2 1 1 3 3 3   There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in a safe state. Consider the following independent requests for additional resources in the current state: REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Which one of the following is TRUE?
Study the following information and select guilty person. Ram was visiting a place where inhabitants always answer any question with two sentences. One of these is always true while other is always false. While on the visit he found that his bag has been stolen and he suspected three persons those visited his guest room. He was sure that only one person is guilty. When he questioned them they replied as follows. R ∶ S did not do it. I did not do it. S ∶ I did not do it. P did not do it. T ∶ I did not do it. I did not know who did it.
In spite of my requests, he did not _____
In spite of my requests, he did not.
A' was on his journey by car from Bhopal to Indore. 'B' met him in the way and requested for a lift upto Ujjain. 'A' agreed to his but on reaching Ujjain did not drop 'B' there in spite of his repeated requests. 'B' was carried over by 'A' to Indore against his wishes. Here:
Consider a disk system having 60 cylinders. Disk requests are received by a disk drive for cylinders 10, 22, 20, 2, 40, 6, and 38, in that order. Assuming the disk head is currently at cylinder 20, what is the time taken to satisfy all the requests if it takes 2 milliseconds to move from one cylinder to an adjacent one and Shortest Seek Time First (SSTF) algorithm is used ?
Consider the following five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time. (P, 155), (Q, 85), (R, 110), (S, 30), (T, 115) Assume the head is positioned at cylinder 100. The scheduler follows Shortest Seek Time First scheduling to service the requests. Which one of the following statements is FALSE?
DispatcherServtlet dispatches portlet requests to appropriate handlers that handle the requests.
In the _______ algorithm, the disk head moves from one end to the other, servicing requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.
What are the characteristics of fully distributed approach? i) When responses are received from all processes, then process can enter its Critical Section ii) When process exits its critical section, the process sends reply messages to all its deferred requests. iii) It requires request,reply and release per critical section entry iv) One processor as coordinator which handles all requests