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

Q. R-timestamp(Q) denotes?

View solution

Q. A ________ ensures that any conflicting read and write operations are executed in timestamp order

View solution

Q. The default timestamp ordering protocol generates schedules that are

View solution

Q. State true or false: The Thomas write rule has a greater potential concurrency than the timestamp ordering protocol

View solution

Q. Which of the following timestamp based protocols generates serializable schedules?

View solution

Q. In timestamp ordering protocol, suppose that the transaction Ti issues read(Q) and TS(Ti)<W-timestamp(Q), then

View solution

Q. In timestamp ordering protocol, suppose that the transaction Ti issues write(Q) and TS(Ti)<W-timestamp(Q), then

View solution

Q. The _________ requires each transaction executes in two or three different phases in its lifetime

View solution