CSE MCQs :: DBMS MCQs
- 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.
- The deadlock state can be changed back to stable state by using _____________ statement.
- What are the ways of dealing with deadlock ?
- 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
- 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
- The deadlock in a set of transaction can be determined by
- A deadlock exists in the system if and only if the wait-for graph contains a ___________.
- Selecting the victim to be rollbacked to the previous state is determined by the minimum cost. The factors determining cost of rollback is
- __________ rollback requires the system to maintain additional information about the state of all the running transactions.
A.
How long the transaction has computed, and how much longer the transaction will compute before it completes its designated task.
|
B.
How many data items the transaction has used.
|
C.
How many more data items the transaction needs for it to complete.
|
D.
How many transactions will be involved in the rollback.
|
E.
All of the mentioned
|