Back to the 2023 paper

Module 4: Deadlocks

20232m

A computer system has 9 tape drives, with 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
(i) 9
(ii) 7
(iii) 4
(iv) 6

Similar questions