Deadlocks are possible only when one of the transactions wants to obtain a(n) ____ lock on a data item.

Related MCQs

• A(n) ____ lock exists when concurrent transactions are granted Read access on the basis of a common lock.
• The situation where the lock waits only for a specified amount of time for another lock to be released is
•                      are used to ensure that transactions access each data item in order of the transactions’          if their accesses conflict.
• In a ____ lock, the DBMS will lock an entire disk page.
• Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
• Each of a pair of transactions has read data that is written by the other, but there is no data written by both transactions, is referred to as
• A lock that allows concurrent transactions to access different rows of the same table is known as a
• A lock that allows concurrent transactions to access different rows of the same table is known as a
• A lock that allows concurrent transactions to access different rows of the same table is known as a
• The          lock allows concurrent transactions to access the same row as long as they require the use of different fields within that row.