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. |
THE____________REQUIRES_THAT_EACH_TRANSACTION_TI_EXECUTES_IN_TWO_OR_THREE_DIFFERENT_PHASES_IN_ITS_LIFETIME,_DEPENDING_ON_WHETHER_IT_IS_A_READ-ONLY_OR_AN_UPDATE_TRANSACTION.?$ |
| A. | Validation protocol |
| B. | Validation-based protocol |
| C. | Timestamp protocol |
| D. | Timestamp-ordering protocol |
| Answer» B. Validation-based protocol | |
| 2. |
This_validation_scheme_is_called_the___________scheme_since_transactions_execute_optimistically,_assuming_they_will_be_able_to_finish_execution_and_validate_at_the_end.$ |
| A. | Validation protocol |
| B. | Validation-based protocol |
| C. | Timestamp protocol |
| D. | Optimistic concurrency-control |
| Answer» B. Validation-based protocol | |
| 3. |
The _____________ ensures that any conflicting read and write operations are executed in timestamp order? |
| A. | Timestamp-ordering protocol |
| B. | Timestamp protocol |
| C. | W-timestamp |
| D. | R-timestamp |
| Answer» B. Timestamp protocol | |
| 4. |
____________ denotes the largest timestamp of any transaction that executed write(Q) successfully. |
| A. | W-timestamp(Q) |
| B. | R-timestamp(Q) |
| C. | RW-timestamp(Q) |
| D. | WR-timestamp(Q) |
| Answer» B. R-timestamp(Q) | |
| 5. |
If a node is locked in ______________ the subtree rooted by that node is locked explicitly in shared mode, and that explicit locking is being done at a lower level with exclusive-mode locks. |
| A. | Intention lock modes |
| B. | shared and intention-exclusive (SIX) mode |
| C. | Intention-exclusive (IX) mode |
| D. | Intention-shared (IS) mode |
| Answer» C. Intention-exclusive (IX) mode | |
| 6. |
If a node is locked in ____________ then explicit locking is being done at a lower level, with exclusive-mode or shared-mode locks. |
| A. | Intention lock modes |
| B. | Intention-shared-exclusive mode |
| C. | Intention-exclusive (IX) mode |
| D. | Intention-shared (IS) mode |
| Answer» D. Intention-shared (IS) mode | |
| 7. |
If a node is locked in __________ explicit locking is being done at a lower level of the tree, but with only shared-mode locks. |
| A. | Intention lock modes |
| B. | Intention-shared-exclusive mode |
| C. | Intention-exclusive (IX) mode |
| D. | Intention-shared (IS) mode |
| Answer» B. Intention-shared-exclusive mode | |
| 8. |
If a node is locked in an intention mode, explicit locking is done at a lower level of the tree. This is called |
| A. | Intention lock modes |
| B. | Explicit lock |
| C. | Implicit lock |
| D. | Exclusive lock |
| Answer» B. Explicit lock | |
| 9. |
In a database the file is contained in ________ |
| A. | Entire database |
| B. | Two area |
| C. | One area |
| D. | more than one area |
| Answer» D. more than one area | |
| 10. |
In a granularity hierarchy the highest level represents the |
| A. | Entire database |
| B. | Area |
| C. | File |
| D. | Record |
| Answer» B. Area | |