Question:

Consider a system with the following: - \(\mathbb{P} = \{ P_1, P_2, P_3, P_4 \}\) consists of all active processes in an operating system. - \(\mathbb{R} = \{ R_1, R_2, R_3, R_4 \}\) consists of single instances of distinct types of resources in the system. 
The resource allocation graph has the following assignment and claim edges: Assignment edges: \[ R_1 \to P_1, \quad R_2 \to P_2, \quad R_3 \to P_3, \quad R_4 \to P_4 \] (The assignment edge \( R_1 \to P_1 \) means resource \( R_1 \) is assigned to process \( P_1 \), and so on for others.)
Claim edges: \[ P_1 \to R_2, \quad P_2 \to R_3, \quad P_3 \to R_1, \quad P_2 \to R_4, \quad P_4 \to R_2 \] (The claim edge \( P_1 \to R_2 \) means process \( P_1 \) is waiting for resource \( R_2 \), and so on for others.) 
Which of the following statement(s) is/are CORRECT?

Show Hint

{To eliminate a deadlock in a resource allocation graph, identify the circular wait condition and break it by removing one or more processes.}
Updated On: Apr 7, 2025
  • {Aborting} \( P_1 \) {makes the system deadlock free.}
  • {Aborting} \( P_3 \) {makes the system deadlock free.}
  • {Aborting} \( P_2 \) {makes the system deadlock free.}
  • {Aborting} \( P_1 \) {and} \( P_4 \) {makes the system deadlock free.}
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C, D

Solution and Explanation

Was this answer helpful?
0
0

Top Questions on Operating Systems