A computer has 6 tape drives with ‘n’ processes competing for them. Each process may need two drives. For which values of ‘n’ is the system deadlock free ?
A. 1
B. 2
C. 3
D. 6
Answer:C
A computer has 6 tape drives with ‘n’ processes competing for them. Each process may need two drives. For which values of ‘n’ is the system deadlock free ?
A. 1 B. 2 C. 3 D. 6