The wait-for graph is a deadlock detection algorithm that is applicable when

Related MCQs

• Which one of the following is the deadlock avoidance algorithm?
• A deadlock avoidance algorithm dynamically examines the                      to ensure that a circular wait condition can never exist.
• Which one of the following is the deadlock avoidance algorithm?
• Which one of the following is the deadlock avoidance algorithm?
• If deadlocks occur frequently, the detection algorithm must be invoked                  
• What is the disadvantage of invoking the detection algorithm for every request?
• Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify
• The resource allocation graph is not applicable to a resource allocation system
• A deadlock free solution to the dining philosophers problem                          
• Which of the following condition is required for a deadlock to be possible?