Problem 1 (12 points) Recall the various deadlock detection and prevention algorithms we've discussed in this course, an

[answerhappygod]

Problem 1 12 Points Recall The Various Deadlock Detection And Prevention Algorithms We Ve Discussed In This Course An 1 (79.8 KiB) Viewed 42 times

i) Is this system currently deadlocked, or can any processbecome deadlocked? Why or why not? If not deadlocked, give anexecution order.
.
ii) If a request from a process P1 arrives for (0, 4, 2,0), can the request be immediately granted? Why or why not? If yes,show an execution order.
iii) If a request from a process P2 arrives for (0, 1, 2,0), can the request be immediately granted? Why or why not? If yes,show an execution order.
Problem 1 (12 points) Recall the various deadlock detection and prevention algorithms we've discussed in this course, and consider the following snapshot of a system with five processes (P1, P2, P3, P4, P5) and four resources (R1, R2, R3, R4). There are no current outstanding queued unsatisfied requests. Currently Available Resources R1 0 Process R1 P1 P2 P3 P4 Current Allocation P5 2 lo 0 4 4 2 R2 R3 0 1 0 0 0 3 3 5 3 3 R2 1 R4 0 2 0 2 0 Max Need R1 R2 2 0 0 R3 2 6 6 2 7 6 3 6 R3 R4 3 5 5 5 5 0 2 6 4 0 R4 2 Still Needs R1 R2 R3 R4