1.

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) 5(B) 4(C) 3(D) 6

Answer»


Discussion

No Comment Found

Related InterviewSolutions