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?

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Operating System (OS)

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?

(A) 2
(B) 3
(C) 4
(D) 1

💬 Discuss

✅ Correct Answer: (A) 2

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

879

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

90%

Success Rate