🎙 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 13 of 15

4 processes each need at most 3 instances of a resource. What is the minimum number of instances that guarantees no dea…

4 processes each need at most 3 instances of a resource. What is the minimum number of instances that guarantees no deadlock?

  1. A.8
  2. B.9
  3. C.12
  4. D.13
Answer & explanation

Correct answer: 9

R = n(k − 1) + 1 = 4 × 2 + 1 = 9.

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 →