Computer Sciences > GATE 2015 SET-3 > Deadlock Prevention
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?
(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?
Explanation
Correct : a
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.