MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Rdbms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are |
| A. | Non conflict equivalent |
| B. | Equal |
| C. | Conflict equivalent |
| D. | Isolation equivalent |
| Answer» D. Isolation equivalent | |
| 2. |
Which of the following is the most expensive method? |
| A. | Timestamping |
| B. | Plain locking |
| C. | Predicate locking |
| D. | Snapshot isolation |
| Answer» D. Snapshot isolation | |
| 3. |
State true or false: If I = read(Q) and J = write(Q) then the order of I and J does not matter. |
| A. | True |
| B. | False |
| Answer» C. | |
| 4. |
State true or false: If I = read(Q) and J = read(Q) then the order of I and J does not matter. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 5. |
A ___________of the transactions can be obtained by finding a linear order consistent with the partial order of the precedence graph. |
| A. | Serializability order |
| B. | Direction graph |
| C. | Precedence graph |
| D. | Scheduling scheme |
| Answer» B. Direction graph | |
| 6. |
The set of ________ in a precedence graph consists of all the transactions participating in the schedule |
| A. | Vertices |
| B. | Edges |
| C. | Directions |
| D. | None of the mentioned |
| Answer» B. Edges | |
| 7. |
A schedule is __________ if it is conflict equivalent to a serial schedule. |
| A. | Conflict serializable |
| B. | Conflicting |
| C. | Non serializable |
| D. | None of the mentioned |
| Answer» B. Conflicting | |
| 8. |
If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are$ |
| A. | Non conflict equivalent |
| B. | Equal |
| C. | Conflict equivalent |
| D. | Isolation equivalent |
| Answer» D. Isolation equivalent | |
| 9. |
I and J are _________ if they are operations by different transactions on the same data item, and at least one of them is a write operation. |
| A. | Conflicting |
| B. | Overwriting |
| C. | Isolated |
| D. | Durable |
| Answer» B. Overwriting | |