If the wait for graph contains a cycle
A)then a deadlock does not exist
B)then a deadlock exists
C)then the system is in a safe state
D)either deadlock exists or system is in a safe state

Question

Quizplus · Accepted Answer

A wait for graph is used to represent the allocation of resources and process requests in a system. If the wait for graph contains a cycle, it means that there is a set of processes each of which is waiting for a resource held by another process in the set. This situation indicates a deadlock because none of the processes can proceed until one of them releases a resource, which will not happen since each process is waiting for another resource to be released first.

If the Wait for Graph Contains a Cycle