Question

A system has three resources R1,R2,R3, with total instances 5, 3, and 4, respectively. Processes P1,P2,P3 are allocated (2, 1, 2), (1, 1, 1), and (1, 1, 2). The remaining needs are (1, 1, 1), (1, 1, 2), and (1, 1, 0). Can the system avoid deadlock?

A Yes, if P1 completes first.
B No, deadlock is inevitable.
C Yes, if P2 completes first.
D Yes, if P3 completes first.
E Insufficient data to determine.
Practice Next

Hey! Ask a query