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?
Correct : a
Similar Questions
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that dea...
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64
Total Unique Visitors
Loading......