The wait-for graph is a deadlock detection algorithm that is applicable when
A)all resources have a single instance
B)all resources have multiple instances
C)all resources have a single 7 multiple instances
D)all of the mentioned

Question

Quizplus · Accepted Answer

The wait-for graph is specifically designed for scenarios where all resources have a single instance. In such graphs, nodes represent processes, and an edge from one process to another indicates that the first process is waiting for a resource held by the second process. This method is not directly applicable for resources with multiple instances, as the graph does not capture the complexity of multiple instances being held and requested.

The Wait-For Graph Is a Deadlock Detection Algorithm That Is