reopened by
1,857 views
2 votes
2 votes

Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?

  1. In deadlock prevention, the request for resources is always granted if resulting state is safe.
  2. In deadlock avoidance, the request for resources is always granted. if the resulting state is safe.
  3. Deadlock avoidance requires knowledge of resource requirements a priori.
  4. Deadlock prevention is more restrictive than deadlock avoidance.
reopened by

2 Answers

Best answer
4 votes
4 votes

Deadlock prevention tries to break one of the four necessary conditions of deadlock. It may reject resource requests even if the resulting state is safe in order to break necessary condition.

Eg: ordering of resources may reject some requests even though they are safe

  • Prevention is similar to a traffic light while avoidance is similar to a police officer directing traffic
  • Deadlock avoidance is less strict than deadlock prevention. It allows mutual exclusion, wait and hold, no preemption, but prevents circular wait. Deadlock avoidance only checks safe states. The request for resources is always granted if the resulting state is safe

Option A is false, all other options are true

selected by
Answer:

Related questions

6 votes
6 votes
2 answers
1
gatecse asked Dec 17, 2017
3,131 views
A counting semaphore was initialized t o $7$. Then $\text{20 P (wait)}$ operations and$\text{x V (signal)}$ operations were completed on this semaphore. If the final valu...
2 votes
2 votes
1 answer
3
gatecse asked Dec 17, 2017
2,922 views
Consider the following table :$\begin{array}{|l|l|l|} \hline \textbf{A.} & \text{Activation record} & \textbf{p.} & \text{Linking loader} \\\hline \textbf{B.} & \text{Loc...