A deadlock exists in the system if and only if the wait for graph:

Related MCQs

• A deadlock exists in the system if and only if the wait-for graph contains a                        
• The three basic techniques to control deadlocks are: deadlock ____, deadlock detection, and deadlock avoidance.
• When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj). Otherwise, Ti is rolled back (dies). This is
• When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti). This is
• 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
• In a                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.