Which of the following is NOT a valid deadlock prevention scheme?
2000
Which of the following is NOT a valid deadlock prevention scheme?
- A.
Release all resources before requesting a new resource
- B.
Number the resources uniquely and never request a lower numbered resource than the last one requested.
- C.
Never request a resource after releasing any resource
- D.
Request all required resources be allocated before execution.
Attempted by 60 students.
Show answer & explanation
Correct answer: C
Deadlock prevention schemes involve breaking at least one of the four necessary conditions for deadlock: mutual exclusion, hold-and-wait, no preemption, and circular wait. Valid schemes include requiring all resources at once or imposing a resource ordering.
A video solution is available for this question — log in and enroll to watch it.