Q. 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? (Solved)
1. 2
2. 3
3. 4
4. 1
- a. 2
1. 2
2. 3
3. 4
4. 1