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
The question was asked in examination.
My doubt stems from Deadlock Detection in chapter Deadlocks of Operating System