A system has three resources R1,R2,R3, with total

Solution

Using the Banker’s Algorithm, we determine if the system can execute all processes without entering a deadlock. 1. Available resources initially: R1=1,R2=0,R3=0 2. If P1 finishes first, it releases R1=2,R2=1,R3=2. Available becomes R1=3,R2=1,R3=2. 3. Now P2 can execute, releasing R1=1,R2=1,R3=1. Available becomes R1=4,R2=2,R3=3. 4. Finally, P3 completes, releasing all its resources. Hence, no deadlock occurs if P1 is completed first. Why Other Options Are Incorrect: • B) No, deadlock is inevitable: Incorrect because deadlock can be avoided by choosing the correct execution order. • C) & D): Incorrect as P2 or P3 cannot execute first due to insufficient resources. • E) Insufficient data: Incorrect as the problem provides all necessary data.