A computer system has 6 tape drives, with 'n' processes competing 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?
A)2
B)3
C)4
D)1

Question

Quizplus · Accepted Answer

To ensure the system is deadlock-free, each process must be able to obtain up to 3 tape drives. If there are 2 processes, each can potentially obtain 3 drives, using all 6 drives without causing a deadlock. However, with more than 2 processes, it's possible for each process to hold 2 drives without any being able to obtain a third, leading to a deadlock. Therefore, the maximum number of processes (n) for a deadlock-free system is 2.

A Computer System Has 6 Tape Drives, with 'N' Processes