Question: A system has processes P1, P2, P3 and resources R1, R2, R3. The assignment edges connect these: R1-2, R2-P2, R3-P3. Request edges connect there: P1-R3,

A system has processes P1, P2, P3 and resources R1, R2, R3. The assignment edges connect these: R1-2, R2-P2, R3-P3. Request edges connect there: P1-R3, P2-R1, P3-R2. There is only one instance of each resource. Is this system deadlocked? You may have to draw a the resource allocation graph, with proper labels and arrows. Yes, because it has a cycle. O Yes, because it has 3 cycles. O No O There is not enough information
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
