A computer has 6 tape drivers,with ‘n’ processes competing for them.Each process may need 3 tape drivers.the maximum value of ‘n’ for which the system is guaranteed to be deadlock free is
a)1 b)2 c)3 d)4
I think the answer must be 2 since
Let P-1 contains 2 drivers and P2 contains 2 drivers and 2 drives are not allocated.
While processing 1 driver will take 1 driver and other will take the other and no dead lock will appear