GATE CSE 2000 | Question: 2.23

Question

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 and all required resources be allocated before execution.

Answer 1

The answer is (C).

• A. is valid. Which dissatisfies Hold and Wait but ends up in starvation.
• B. is valid. Which is used to dissatisfy circular wait.
• C. is invalid.
• D. is valid and is used to dissatisfy Hold and Wait.

Comments

Kushagra गुप्ता you are right but if we are only considering increasing order then also it is valid as deadlock prevention scheme.

---

Mk Utkarsh  yes you are right

---

d is valid because it is more like Conservative 2PL, which is very popular in deadlock prevention.

Answer 2

Option A is valid, it will help to violate hold and wait condition. Whenever you request a new resource you release all the previously acquired resources.

Option B is Valid, it is the standard method used for removing circular wait.

Option D is valid, it will also remove Hold and Wait condition.

Hence, option C is the invalid option. And it is invalid also because if you release the resource, some or the other process will be able acquire it and complete execution. Hence, the process can request for a new resource without causing deadlock.