MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Rdbms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following steps must be taken while choosing a victim? |
| A. | Avoiding starvation |
| B. | Number of transactions involved in rollback |
| C. | Data items used by the transaction |
| D. | All of the mentioned |
| Answer» E. | |
| 2. |
State true or false: Partial rollback is not possible. |
| A. | True |
| B. | False |
| Answer» C. | |
| 3. |
Which of the following is not a method in deadlock handling |
| A. | Deadlock prevention |
| B. | Deadlock detection |
| C. | Deadlock recovery |
| D. | Deadlock distribution |
| Answer» E. | |
| 4. |
WHICH_OF_THE_FOLLOWING_STEPS_MUST_BE_TAKEN_WHILE_CHOOSING_A_VICTIM??$ |
| A. | Avoiding starvation |
| B. | Number of transactions involved in rollback |
| C. | Data items used by the transaction |
| D. | All of the mentioned |
| Answer» E. | |
| 5. |
State true or false: Partial rollback is not possible? |
| A. | True |
| B. | False |
| Answer» C. | |
| 6. |
How do we generally recover from a deadlock? |
| A. | By aborting all the transactions |
| B. | By rolling back all the transactions |
| C. | By rolling back only a selected number of transactions |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 7. |
The _________ graph describes deadlocks precisely |
| A. | Wound wait graph |
| B. | Wait die graph |
| C. | Wait for graph |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 8. |
Lock timeouts have which of the following advantages? |
| A. | Unnecessary rollbacks do not occur |
| B. | Transactions do not starve |
| C. | It is easy to implement |
| D. | All of the mentioned |
| Answer» E. | |
| 9. |
State true or false: Wait die scheme is a non-preemptive technique |
| A. | True |
| B. | False |
| Answer» B. False | |
| 10. |
Deadlocks can be prevented using |
| A. | Preemption and transaction rollbacks |
| B. | Wait and die scheme |
| C. | Wound-wait scheme |
| D. | All of the mentioned |
| Answer» E. | |
| 11. |
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. |
| A. | Deadlock |
| B. | Starved |
| C. | Isolated |
| D. | None of the mentioned |
| Answer» B. Starved | |