Q71

MCQ2 marks, −0.5

Suppose $n$ processes, $P_1, \dots 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?

(A)

$\forall i,\: s_i, < m$

(B)

$\forall i, \:s_i <n$

(C)

$\displaystyle{\sum_{i=1}^n} \: s_i < (m+n)$

(D)

$\displaystyle{\sum_{i=1}^n} \: s_i < (m \times n)$

Loading…