MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Rdbms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In timestamp ordering protocol, suppose that the transaction Ti issues write(Q) and TS(Ti)<W-timestamp(Q), then |
| A. | tRead operation is executed |
| B. | tRead operation is rejected |
| C. | tWrite operation is executed |
| D. | tWrite operation is rejected |
| Answer» E. | |
| 2. |
In timestamp ordering protocol, suppose that the transaction Ti issues read(Q) and TS(Ti)<W-timestamp(Q), then |
| A. | tRead operation is executed |
| B. | tRead operation is rejected |
| C. | tWrite operation is executed |
| D. | tWrite operation is rejected |
| Answer» C. tWrite operation is executed | |
| 3. |
Which of the following timestamp based protocols generates serializable schedules? |
| A. | tThomas write rule |
| B. | tTimestamp ordering protocol |
| C. | tValidation protocol |
| D. | tNone of the mentioned |
| Answer» B. tTimestamp ordering protocol | |
| 4. |
State true or false: The Thomas write rule has a greater potential concurrency than the timestamp ordering protocol |
| A. | tTrue |
| B. | tFalse |
| Answer» B. tFalse | |
| 5. |
The default timestamp ordering protocol generates schedules that are |
| A. | tRecoverable |
| B. | tNon-recoverable |
| C. | tStarving |
| D. | tNone of the mentioned |
| Answer» C. tStarving | |
| 6. |
A ________ ensures that any conflicting read and write operations are executed in timestamp order |
| A. | tOrganizational protocol |
| B. | tTimestamp ordering protocol |
| C. | tTimestamp execution protocol |
| D. | t802-11 protocol |
| Answer» C. tTimestamp execution protocol | |
| 7. |
R-timestamp(Q) denotes? |
| A. | tThe largest timestamp of any transaction that can execute write(Q) successfully |
| B. | tThe largest timestamp of any transaction that can execute read(Q) successfully |
| C. | tThe smallest timestamp of any transaction that can execute write(Q) successfully |
| D. | tThe smallest timestamp of any transaction that can execute read(Q) successfully |
| Answer» C. tThe smallest timestamp of any transaction that can execute write(Q) successfully | |
| 8. |
W-timestamp(Q) denotes? |
| A. | tThe largest timestamp of any transaction that can execute write(Q) successfully |
| B. | tThe largest timestamp of any transaction that can execute read(Q) successfully |
| C. | tThe smallest timestamp of any transaction that can execute write(Q) successfully |
| D. | tThe smallest timestamp of any transaction that can execute read(Q) successfully |
| Answer» B. tThe largest timestamp of any transaction that can execute read(Q) successfully | |
| 9. |
A logical counter is _________ after a new timestamp has been assigned |
| A. | tIncremented |
| B. | tDecremented |
| C. | tDoubled |
| D. | tRemains the same |
| Answer» B. tDecremented | |
| 10. |
Which of the following cannot be used to implement a timestamp |
| A. | tSystem clock |
| B. | tLogical counter |
| C. | tExternal time counter |
| D. | tNone of the mentioned |
| Answer» D. tNone of the mentioned | |