Bissoy.com
Doctors Medicines MCQs Q&A

Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.

Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock. Correct Answer resources currently available

Related Questions

A system has n resources R0,…,Rn-1, and k processes P0,…..Pk-1. The implementation of the resource request logic of each process Pi. is as follows: if (i%2 == 0) { if (i
Consider the following policies for preventing deadlock in a system with mutually exclusive resources. I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources Which of the above policies can be used for preventing deadlock?
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is ?. Three semaphores empty, full and mutex are defined with respective initial values of 0, ? and 1. Semaphore empty denotes the number of available slots in the buffer, for the consumer to read from. Semaphore denotes the number of available slots in the buffer, for the producer to write to. The placeholder variables, denoted by P, Q, R, and S, in the code below can be assigned either empty or full. The valid semaphore operations are: wait ( ) and signal ( ). Producer: Consumer: do {         wait (P) ;         wait (mutex) ;         //Add item to buffer         signal (mutex) ;         signal (Q) ; } while (1) ; do {          wait (R) ;          wait (mutex) ;          //Consume item from buffer          signal (mutex) ;          signal (S) ; } while (1) ;   Which one of the following assignments to P, Q, R and S will yield the correct solution?
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?
This question comprises 3 sentences - A, B and C each of which comprises a sentence using the word WAIT. Identify the sentences where the word has been correctly used and mark that combination (A) Wait your options before investing (B) How long must we wait? (C) The longer we wait time the less is the chance of recovery
Consider the following threads, T1, T2, and T3 executing on a single processor, synchronized using three binary semaphore variables, S1, S2, and S3, operated upon using standard wait() and signal(). The threads can be context switched in any order and at any time. T1 T2 T3 While(true) { Wait(S3); Print(“C”); Signal (S2); } While(true) { Wait(S1); Print(“B”); Signal (S3); } While(true) { Wait(S2); Print(“A”); Signal (S1); }   Which initialization of the semaphores would print the sequence BCABCABCA….?
h,J,K,L,M,N and O are the only legislators eligible to vote on Bills 1,2 and 3, each of which will be passed if at least four legislators eligible vote in favor of it. each legislator must vote on all three bills; on abstentions are possible. The following is known : *H must vote against all three bills; each of the other legislators must vote in favor of at least one bill and against at lest one bill. *j must vote against Bills 1. *O Must vote against Bills 2 and 3. * L must the same way that K dose on all three bills.*N must vote the same way that O dose on all three bills. which of the following must vote in favor of Bill 1 ?
h,J,K,L,M,N and O are the only legislators eligible to vote on Bills 1,2 and 3, each of which will be passed if at least four legislators eligible vote in favor of it. each legislator must vote on all three bills; on abstentions are possible. The following is known : *H must vote against all three bills; each of the other legislators must vote in favor of at least one bill and against at lest one bill. *j must vote against Bills 1. *O Must vote against Bills 2 and 3. * L must the same way that K dose on all three bills.*N must vote the same way that O dose on all three bills. If any bill is to be passed,which of the following must be among the legislators who vote in favor of it?
h,J,K,L,M,N and O are the only legislators eligible to vote on Bills 1,2 and 3, each of which will be passed if at least four legislators eligible vote in favor of it. each legislator must vote on all three bills; on abstentions are possible. The following is known : *H must vote against all three bills; each of the other legislators must vote in favor of at least one bill and against at lest one bill. *j must vote against Bills 1. *O Must vote against Bills 2 and 3. * L must the same way that K dose on all three bills.*N must vote the same way that O dose on all three bills. If M votes the same way that O dose on all three bills, which of the following can be determined ?
h,J,K,L,M,N and O are the only legislators eligible to vote on Bills 1,2 and 3, each of which will be passed if at least four legislators eligible vote in favor of it. each legislator must vote on all three bills; on abstentions are possible. The following is known : *H must vote against all three bills; each of the other legislators must vote in favor of at least one bill and against at lest one bill. *j must vote against Bills 1. *O Must vote against Bills 2 and 3. * L must the same way that K dose on all three bills.*N must vote the same way that O dose on all three bills. The maximum number of favorable votes that Bill 2 could receive is ---