Consider the directed resorce graph shown in Figure 5.18 and answer the followin
ID: 3544093 • Letter: C
Question
Consider the directed resorce graph shown in Figure 5.18 and answer the following questions:
a. Identify all of the deadlocked processes.
b. Can the directed graph be reduced, partially or totally?
c. Can the deadlock be resolved without selecting a victim?
d. Which requests by three processes for resources from R2 would you satisfy to minimize the number of processes involved in the deadlock?
Consider the directed resorce graph shown in Figure 5.18 and answer the following questions: Identify all of the deadlocked processes. Can the directed graph be reduced, partially or totally? Can the deadlock be resolved without selecting a victim? Which requests by three processes for resources from R2 would you satisfy to minimize the number of processes involved in the deadlock? Which requests by three processes for resources from R2 would you satisfy to maximize the number of processes involved in the deadlock?Explanation / Answer
A. Deadlocked process P3 and P4
B. no
C. No we can't resolve the deadlock without selecting the victim.
D. There is no requst suct that it will minimize the no of process involved in deadlock. Since P3 and P4 holding a resource and waiting for another resource.
E. if we fulfill the request of P3 first then P1 and P2 process can't complete its is excution but P1 and P2 process is not involved in deadlock since there is circular wait involving process P1 and P2. By giving the resorce to P3 we are just delaying the P1 and P2. Means there will be no change in deadlock process.