Question: The fourth and final condition for deadlocks is the circular-wait condition. One way to ensure that this condition never holds .Which of the following protocol should be used. <ol> <li>a process requesting an instance of resource type Rj must have released any resources Ri such that F(Ri) ≥ F(Rj).</li> <li>protocol allows a process to request resources only when it has none. A process may request some resources and use them. Before it can request any additional resources, it must release all the resources that it is currently allocated.</li> <li>If a process is holding some resources and requests another resource that cannot be immediately allocated to it (that is, the process must wait), then all resources the process is currently holding are preempted</li> <li>Each process can request resources only in an increasing order of enumeration. That is, a process can initially request any number of instances of a resource type —say, Ri. After that, the process can request instances of resource type Rj if and only if F(Rj) > F(Ri).</li> </ol>  

MCQ: The fourth and final condition for deadlocks is the circular-wait condition. One way to ensure that this condition never holds .Which of the following protocol should be used. <ol> <li>a process requesting an instance of resource type Rj must have released any resources Ri such that F(Ri) ≥ F(Rj).</li> <li>protocol allows a process to request resources only when it has none. A process may request some resources and use them. Before it can request any additional resources, it must release all the resources that it is currently allocated.</li> <li>If a process is holding some resources and requests another resource that cannot be immediately allocated to it (that is, the process must wait), then all resources the process is currently holding are preempted</li> <li>Each process can request resources only in an increasing order of enumeration. That is, a process can initially request any number of instances of a resource type —say, Ri. After that, the process can request instances of resource type Rj if and only if F(Rj) > F(Ri).</li> </ol>  

• A. 1,2
• B. 1,3
• C. 1,4
• D. 3,4