Question

In a system with multiple instances of resources, the resource allocation graph for deadlock avoidance does NOT contain the following edge:

• A. Request edge
• B. Assignment edge
• C. Claim edge
• D. Process edge

Hint:

In a resource allocation graph, focus on request, assignment, and claim edges. Process edges are not used for deadlock avoidance.

Answer 1

The Correct Option is D

When avoiding deadlocks in systems with multiple resource instances, the resource allocation graph utilizes specific edge types:- Request edge: Denotes a process's request for a resource (process $\rightarrow$ resource).- Assignment edge: Indicates a resource allocated to a process (resource $\rightarrow$ process).- Claim edge: Used in algorithms like the Banker's algorithm to signify a future potential resource request by a process.Conversely, the process edge is not a component of the resource allocation graph for deadlock avoidance.Step 2: Conclusion.
Therefore, the correct identification is (4) Process edge.