Anonymous user menu


A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?
(a) 6
(b) 5
(c) 4
(d) 3



Amit Pal @amitpal101
26 Sep 2016 12:11 pm

total given tape drivers = 6
total process = n
each require = 2
so minimum value of n for which this system will be in deadlock .
n*(1)= 6 => (n=6)
so for n=5 is the maximum possible value for which this system will be deadlock free.
Ans (b) 5