A Computer System Has 6 tapes drives GATE 1992 OS
A Computer System Has 6 tapes drives,with n process completing for them.Each process may need 3 tape drives.The maximum value of n for which the system is guaranteed to be deadlock free is ( GATE 1992) (A)2 (B)3 (C)4 (D)1 Ans:- 2 Explanation:- Rules: [ sum of need of processes<no of process+total number of resources] Sum of need processes=3n no of process= n total number of resources= 6 so, 3n<n+6 =>3n-n<6 =>2n<6 => n<3 So,The Maximum value of n is 2 which is guaranteed to be deadlock free.