A deadlock exists in the system if and only if the wait-for graph contains a                        

Related MCQs

• The three basic techniques to control deadlocks are: deadlock ____, deadlock detection, and deadlock avoidance.
• A deadlock exists in the system if and only if the wait for graph:
• The system has entered an undesirable state (for example, deadlock), as a result of which a transaction cannot continue with its normal execution. This is
• The deadlock state can be changed back to stable state by using                             statement.
• What are the ways of dealing with deadlock?
• The deadlock in a set of a transaction can be determined by
• The deadlock can be handled by
• A system is in a              state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set.
• If an index is                                    the metadata and statistics continue to exists
• Which mapping exists between the conceptual and internal levels: