The GATE Grind

GATE 2009 CS – Question 30

Operating System · Deadlock · 2 marks · Multiple choice

Resources R1, R2, R3, R4 have 3, 2, 3, 2 units respectively. Allocation is non-preemptive; a request is not entertained unless completely satisfied. Independently the processes request/release resources at these times:

P1: t=0 request2 R2; t=1 request1 R3; t=3 request2 R1; t=5 release1 R2 and1 R1; t=7 release1 R3; t=8 request2 R4; t=10 finish.

P2: t=0 request2 R3; t=2 request1 R4; t=4 request1 R1; t=6 release1 R3; t=8 finish.

P3: t=0 request1 R4; t=2 request2 R1; t=5 release2 R1; t=7 request1 R2; t=8 request1 R3; t=9 finish.

Which statement is TRUE if all start concurrently at t=0?

  1. All processes finish without deadlock.
  2. Only P1 and P2 deadlock.
  3. Only P1 and P3 deadlock.
  4. All three deadlock.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (A) All processes finish without deadlock.

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Deadlock questions

All Deadlock questions →