GATE CSE 2005 | Deadlocks Question 16 | Operating Systems

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

Suppose n processes, P₁,......., P_n share m identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process P_i is S_i, where S_i > 0. Which one of the following is a sufficient condition for ensuring that deadlock does not occur?

$$\forall i,{s_i} < m$$

$$\forall i,{s_i} < n$$

$$\sum\limits_{i = 1}^n {{s_i}} < \left( {m + n} \right)$$

$$\sum\limits_{i = 1}^n {{s_i}} < \left( {m \times n} \right)$$

GATE CSE 2000

MCQ (Single Correct Answer)

-0.6

Which of the following is NOT a valid deadlock prevention scheme?

Release all resources before requesting a new resource

Number the resources uniquely and never request a lower numbered resource than the last one requested.

Never request a resource after releasing any resource

Request and all required resources be allocated before execution.

GATE CSE 1997

MCQ (Single Correct Answer)

-0.6

An operating system contains 3 user processes each requiring 2 units of resource R.The minimum number of units of R such that no deadlocks will ever arise is

GATE CSE 1993

MCQ (Single Correct Answer)

-0.6

Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C, which have peak demands of 3, 4 and 6 respectively. For what value of m deadlock will not occur?