Q. A transaction is made to wait until all ________ locks held on the item are released

View solution

Q. State true or false: It is not necessarily desirable for a transaction to unlock a data item immediately after its final access

View solution

Q. The situation where no transaction can proceed with normal execution is known as ________

View solution

Q. The protocol that indicates when a transaction may lock and unlock each of the data items is called as __________

View solution

Q. If a transaction Ti may never make progress, then the transaction is said to be ____________

View solution

Q. The two phase locking protocol consists which of the following phases?

View solution

Q. If a transaction may obtain locks but may not release any locks then it is in _______ phase

View solution

Q. If a transaction may release locks but may not obtain any locks, it is said to be in ______ phase

View solution

Q. A system is in a _______ state if there exists a set of transactions in which every transaction is waiting for another transaction in the set.

View solution

Q. Which of the following is not a method in deadlock handling

View solution

Q. Deadlocks can be prevented using

View solution

Q. State true or false: Wait die scheme is a non-preemptive technique

View solution

Q. Lock timeouts have which of the following advantages?

View solution

Q. The _________ graph describes deadlocks precisely

View solution

Q. How do we generally recover from a deadlock?

View solution

Q. State true or false: Partial rollback is not possible.

View solution

Q. Which of the following steps must be taken while choosing a victim?

View solution

Q. Which of the following cannot be used to implement a timestamp

View solution

Q. A logical counter is _________ after a new timestamp has been assigned

View solution

Q. W-timestamp(Q) denotes?

View solution