← Quiz: Banker's Algorithm in Practice: all 15 questions
Quiz: Banker's Algorithm in Practice · Question 7 of 15
3 processes each need at most 4 instances of a resource. What is the minimum number of instances that guarantees no dea…
3 processes each need at most 4 instances of a resource. What is the minimum number of instances that guarantees no deadlock?
- A.9
- B.10
- C.12
- D.4
Answer & explanation
Correct answer: 10
n(k − 1) + 1 = 3 × 3 + 1 = 10.
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 →