(Answered): C. Question 1 - Resource Allocation Graph a. Is this system deadlock? State the reason why. b. What ...

C. Question 1 - Resource Allocation Graph a. Is this system deadlock? State the reason why. b. What is the resulting graph after reduction by P1? What is the resulting graph after reduction by P2? d. Both P1 and P2 have requested R2. 1. What is the status of the system if P2's request is granted before P1's? 2. What is the status of the system if P1's request is granted before P2's? P1 R2 P2 Question 2 - Resource Allocation Graph a. As a whole is this system in a deadlock state? Justify. b. Three processes P1, P2 and P3 are requesting resources from R2. Which requests should the operating system satisfy first to minimize and maximize the number of processes involved in the deadlock? Can the graph in FIGURE Q5 be reduced partially or totally? Justify. d. Can the deadlock be resolved without selecting a victim? Justify. C. P1 o R? P2 P3 R3 R4 P4 Question 3 – Resource Allocation Graph a. As a whole is this system in a deadlock state? Justify. b. Two processes P1, P3 are requesting resources from R2. Which requests should the operating system satisfy first to minimize and maximize the number of processes involved in the deadlock? C. Can the graph in FIGURE Q1 be reduced partially or totally? Justify. d. Can the deadlock be resolved without selecting a victim? Justify. P1 9R20 R1 P3 P2 09 R3 R4 P4 P4 Question 4 - Banker's Algorithm a. Available A ?. ? 3 3 2 PO P1 P2 P3 P4 Allocation A | B ? 0 1 0 2 0 0 3 0 2 2 0 0 2 Maximum A ? | ? 7 5 3 3 2 2 9 0 2 2 2 2 4 3 3 1 1 b. Consider tables contain a snapshot of a system: a. What is the content of the matrix Need? b. Is the system in a safe state? Show your way. C. Calculate the Total resources d. If a request from process P5 arrives for (0,3,0), can the request be granted immediately? Available A ?. ? 2 3 0 PO P1 P2 P3 P4 Allocation BC 1 0 0 2 0 2 A 0 3 3 2 0 Maximum A B ? 7 4. 3 0 2 0 6 0 0 0 4. 3 1 1 1 1 1 0 2