Discussion
Which of the following is NOT a valid deadlock prevention scheme ?
Answer: C
The scheme that is NOT a valid prevention scheme is Never request a resource after releasing any resource.
Deadlock prevention works by breaking one of its necessary conditions. Releasing all held resources before requesting a new one, or requesting everything before execution, breaks hold and wait. Numbering resources and requesting them only in increasing order breaks circular wait.
Forbidding requests after any release breaks none of the conditions: a process can still hold some resources while waiting for others, and a cycle of such waits can still form.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development