A computer system has 6 tape drives, with n process competing for them. Each…
1992
A computer system has 6 tape drives, with n process 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
Attempted by 61 students.
Show answer & explanation
Correct answer: A
To guarantee deadlock freedom, we use the formula n(k-1) + 1 <= m. Here m=6 resources and k=3 needed per process. Substituting values gives n(2) + 1 <= 6, which simplifies to 2n <= 5. The maximum integer n satisfying this is 2.
A video solution is available for this question — log in and enroll to watch it.