A computer has six tape drives, with n processes competing for them. Each…
19982025
A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?
- A.
6
- B.
5
- C.
4
- D.
3
Attempted by 75 students.
Show answer & explanation
Correct answer: B
To ensure the system is deadlock-free, apply the formula n(k-1) + 1 <= R. Here resources R=6 and max need k=2, so n(1) + 1 <= 6. This simplifies to n <= 5, meaning the maximum number of processes is 5.
A video solution is available for this question — log in and enroll to watch it.