A computer system has 6 tape drives, with ‘n’ processes competing for them.…
TPSC Computer/IT Posts · 2019 · Programmer (contractual)
A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is
- A.
1
- B.
2
- C.
3
- D.
4
Attempted by 33 students.
Sign up free to check your answer
Sign up freeLoading lesson…