If the wait for graph contains a cycle :

Related MCQs

• If the wait for graph contains a cycle
• The wait-for graph is a deadlock detection algorithm that is applicable when
• An edge from process Pi to Pj in a wait for graph indicates that                          
• If no cycle exists in the resource allocation graph                          
• To enable a process to wait within the monitor                      
• The wait operation of the semaphore basically works on the basic                system call.
• Which is the process of invoking the wait
• The circular wait condition can be prevented by                          
• Each request requires that the system consider the                            to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.
• A deadlock avoidance algorithm dynamically examines the                      to ensure that a circular wait condition can never exist.