test series

Question

Consider the following statements w.r.t. deadlock,
1. An OS implements a policy that requires a process to release all resources before making a request for another resource can lead to starvation but not deadlock.
2. In deadlock prevention, the request for resource is always guaranteed if the resulting state is safe.
3. Deadlock can be prevented, if the resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource number.
4. Deadlock avoidance has less restrictions than deadlock prevention.
Which of the above statement is/are false?

Comments

2 is false 

4>> Deadlock Prevention has more restriction 

3>>resources can be arranged in both decreasing or increasing manner  to prevent deadlock 

1>>see THIs https://gateoverflow.in/3364/gate2008-it-54 for clear explanation 

Answer 1

1. The policy is a deadlock prevention policy, but can lead to starvation.
2. In deadlock prevention, one of the four condition for deadlock must not be satisfied. So, state even being safe can’t led to successful request.
3. It will help in violating circular wait condition for deadlock.
4. Under deadlock avoidance, just the safe state need to be checked and hence is less restrictive deadlock prevention scheme.

Ans only 2 false