Consider the following snapshot of a system running n processes.

Home » Operating Systems » Operating systems miscellaneous » Question

Consider the following snapshot of a system running n processes. Process/is holding X_i instances of a resource R, I ≤ i ≤ n. Currently, all instances of R are occupied. Further, for all i process i has placed a request for an additional y_i instances while holding the x_i instances it already has. There are exactly two processes p and q such that y_p = y_q = 0. Which one of the following can serve as a necessary condition to guarantee that the system is not approaching a deadlock?

1. min (x_p, x_q) < max_kp,py_k)
2. x_p + x_q ≥ max_{k ≠ p,q} y_k
3. max (x_p, x_q) > 1
4. min (x_p, x_q) > 1

Correct Option: B

Here option (b) is that min (x_p ,x_q) < max_k? p,q y_k Means the min no. of resources allocated should be less than the maximum number of resources required by any process other than p & q. So, It prevent from deadlock.
Hence (b) is correct option.