The deadlock in a set of a transaction can be determined by – McqOptions

MCQOPTIONS

1.	The deadlock in a set of a transaction can be determined by
A.	Read-only graph
B.	Wait graph
C.	Wait-for graph
D.	All of the mentioned
Answer» B. Wait graph

Discussion

No Comment Found

Related MCQs

___________ROLLBACK_REQUIRES_THE_SYSTEM_TO_MAINTAIN_ADDITIONAL_INFORMATION_ABOUT_THE_STATE_OF_ALL_THE_RUNNING_TRANSACTIONS.?$
SELECTING_THE_VICTIM_TO_BE_ROLLBACKED_TO_THE_PREVIOUS_STATE_IS_DETERMINED_BY_THE_MINIMUM_COST._THE_FACTORS_DETERMINING_COST_OF_ROLLBACK_IS?$
A deadlock exists in the system if and only if the wait-for graph contains a __________?
The deadlock in a set of a transaction can be determined by
The situation where the lock waits only for a specified amount of time for another lock to be released 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
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
What are the ways of dealing with deadlock?
The deadlock state can be changed back to stable state by using _____________ statement.
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.