Aptitude | GATE CS 1998 | Question 32

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


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post



My Personal Notes arrow_drop_up