GATE 2014 CS (CS3) – Question 41
Three programs each require three tape units. Find the minimum number of tape units that guarantees deadlocks never arise.
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: 7 to 7
Explanation
With three processes each needing3units, six units can be split2,2,2with all processes waiting. One additional unit ensures some process can obtain its third, finish and release its allocation, enabling others. Thus3(3−1)+1=**7units** is the minimum guarantee.