Consider the directed graph and answer the following questions: a) Is the system

ID: 3555359 • Letter: C

Question

Consider the directed graph and answer the following questions:

a) Is the system as a whole, deadlocked ?

b) Are there any deadlocked processes ?

c) 3 processes - P1, P2, P3 are requesting resourcesfrom R2 :

1. Which requests would you satisfy to minimize the number of processes involved in a deadlock ?

2. Which requests would you satisfy to maximize the number of processes involved in a deadlock ?

d) Can the graph be reduced, partially or totally?

e) Can the deadlock be resolved without selecting a victim?

a) no

b)yes, p3 and p4

c) 1. p1 and p2 2. p3

d)yes partially

e)no