MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Database knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
___________ROLLBACK_REQUIRES_THE_SYSTEM_TO_MAINTAIN_ADDITIONAL_INFORMATION_ABOUT_THE_STATE_OF_ALL_THE_RUNNING_TRANSACTIONS.?$ |
| A. | Total |
| B. | Partial |
| C. | Time |
| D. | Commit |
| Answer» C. Time | |
| 2. |
SELECTING_THE_VICTIM_TO_BE_ROLLBACKED_TO_THE_PREVIOUS_STATE_IS_DETERMINED_BY_THE_MINIMUM_COST._THE_FACTORS_DETERMINING_COST_OF_ROLLBACK_IS?$ |
| 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. | All of the mentioned |
| Answer» E. | |
| 3. |
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 |
| Answer» B. Direction | |
| 4. |
The deadlock in a set of a transaction can be determined by |
| A. | Read-only graph |
| B. | Wait graph |
| C. | Wait-for graph |
| D. | All of the mentioned |
| Answer» B. Wait graph | |
| 5. |
The situation where the lock waits only for a specified amount of time for another lock to be released is |
| A. | Lock timeout |
| B. | Wait-wound |
| C. | Timeout |
| D. | Wait |
| Answer» B. Wait-wound | |
| 6. |
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 |
| A. | Wait-die |
| B. | Wait-wound |
| C. | Wound-wait |
| D. | Wait |
| Answer» D. Wait | |
| 7. |
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 |
| A. | Wait-die |
| B. | Wait-wound |
| C. | Wound-wait |
| D. | Wait |
| Answer» B. Wait-wound | |
| 8. |
What are the ways of dealing with deadlock? |
| A. | Deadlock prevention |
| B. | Deadlock recovery |
| C. | Deadlock detection |
| D. | All of the mentioned |
| Answer» E. | |
| 9. |
The deadlock state can be changed back to stable state by using _____________ statement. |
| A. | Commit |
| B. | Rollback |
| C. | Savepoint |
| D. | Deadlock |
| Answer» C. Savepoint | |
| 10. |
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. |
| A. | Idle |
| B. | Waiting |
| C. | Deadlock |
| D. | Ready |
| Answer» D. Ready | |