GATE - 1992 | OS | A computer system has 6 tape drives, with n process completing for
Posted on 03-03-2022
GATE - 1992 [Operating System]
Question:
A computer system has 6 tape drives, with n process completing 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 |
Solution:
Option (B) is Correct.
Lets give 2 tape driver to each process, so that there will be deadlock.
So 3 processes will be given two drives each so that there will be deadlock.
So to avoid deadlock maximum no. of process should be 1 less than the minimum no. of process that will cause deadlock.
So for n=2, the system is guaranteed to be deadlock free.
Thank You