← Quiz: Banker's Algorithm in Practice: all 15 questions
Quiz: Banker's Algorithm in Practice · Question 8 of 15
A system has 6 tape drives and each process needs 2. What is the largest number of processes that can never deadlock?
A system has 6 tape drives and each process needs 2. What is the largest number of processes that can never deadlock?
- A.3
- B.6
- C.5
- D.4
Answer & explanation
Correct answer: 5
n(2 − 1) + 1 ≤ 6 gives n ≤ 5. With 6 processes, each could hold one drive and wait for ever.
Can you get the rest right without peeking?
Take the timed Quiz: Banker's Algorithm in Practice quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →