adplus-dvertising
frame-decoration

Question

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

a.

Cycle

b.

Direction

c.

Bi-direction

d.

Rotation

Posted under DBMS

Answer: (a).Cycle

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. In a granularity hierarchy the highest level represents the

Q. In a database the file is contained in ________

Q. If a node is locked in an intention mode, explicit locking is done at a lower level of the tree. This is called

Q. If a node is locked in __________ explicit locking is being done at a lower level of the tree, but with only shared-mode locks.

Q. If a node is locked in ____________ then explicit locking is being done at a lower level, with exclusive-mode or shared-mode locks.

Q. If a node is locked in ______________ the subtree rooted by that node is locked explicitly in shared mode, and that explicit locking is being done at a lower level with exclusive-mode locks.

Q. ____________ denotes the largest timestamp of any transaction that executed write(Q) successfully.

Q. The _____________ ensures that any conflicting read and write operations are executed in timestamp order.

Q. The __________ requires that each transaction Ti executes in two or three different phases in its lifetime, depending on whether it is a read-only or an update transaction.

Q. This validation scheme is called the _________ scheme since transactions execute optimistically, assuming they will be able to finish execution and validate at the end.

Q. The most recent version of standard SQL prescribed by the American National Standards Institute is

Q. ANSI-standard SQL allows the use of special operators in conjunction with the WHERE clause. A special operator used to check whether an attribute value is null is

Q. A lock that prevents the use of any tables in the database from one transaction while another transaction is being processed is called a

Q. A condition that occurs when two transactions wait for each other to unlock data is known as a(n)

Q. Which of the following is not true about B+ trees?

Q. The extent of the database resource that is included with each lock is called the level of

Q. Snapshot isolation is a particular type of ______________ scheme.

Q. Snapshot isolation is used to give

Q. Lost update problem is

Q. Under first updater wins the system uses a __________ mechanism that applies only to updates.