GATE CSE 2005 | Question: 71

Question

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)$

Comments

not pal its ple

principle

---

$Pigeonhole$ $principle$ is a way how you allocate resources to your processes

thus C is right answer

---

Aakash Pigeonhole Principle :)

Answer 1

Option: C is correct , Bellow the explaination is given , Hope you get useful and clear your doubts

Answer 2

Option: C is correct