🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← 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?

  1. A.3
  2. B.6
  3. C.5
  4. 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 →