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?
Explanation: Given tape drive = 6 and each process may need 2 drive.
When we give 1 drive to 1 process then total process will be 6 but in this case there will definitely deadlock occur because every process contain 1 drive and waiting for another drive which is hold by other process therefore when we reduce 1 process then system to be deadlock free.
Hence maximum value of n = 6 – 1 = 5.
Option (B) is correct.
Quiz of this Question