UGC NET CSE | December 2018 | Part 2 | Question: 70

Question

​​​​​​​Suppose a system has $12$ instances of some resource with $n$ processes competing for that resource. Each process may require $4$ instances of the resources. The maximum value of $n$ for which the system never enters into deadlock is

• A. $3$
• B. $4$
• C. $5$
• D. $6$

Answer 1

Let every process acquired 3 resources now we need 1 more resource to complete one of them so that system will not face deadlock

3n+1<=12

3n<=11

n<=3.66

n=3

option (A)