GATE CSE 2020 Q47: Schedule conflict equivalent to a given two-transaction schedule
- Databases
- 2 marks
- MCQ
- −2/3 if wrong
Question
Consider a schedule of transactions and (time runs left to right):
| RA | RC | WD | WB | Commit | ||||||
| RB | WB | RD | WC | Commit |
| RA | RC | WD | WB | Commit | ||||||
| RB | WB | RD | WC | Commit |
| RA | RC | WD | WB | Commit | ||||||
| RB | WB | RD | WC | Commit |
| RA | RC | WD | WB | Commit | ||||||
| RB | WB | RD | WC | Commit |
| RA | RC | WD | WB | Commit | ||||||
| RB | WB | RD | WC | Commit |
Here, RX stands for "Read(X)" and WX stands for "Write(X)". Which one of the following schedules is conflict equivalent to the above schedule?
Try it: multiple choice: exactly one correct option
Show answer and explanation
Answer: A (official GATE 2020 final answer key)
Concept used: Two schedules are conflict equivalent if every pair of conflicting operations appears in the same order in both.
First step: List the conflicting pairs in the given schedule: 's RB and WB before 's WB, 's RD before 's WD, and 's RC before 's WC. Check each option against them.
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2020 CS question paper and final answer key, organised by IIT Delhi. Question paper · Answer key
More Databases PYQs
- 2026 Session 1 · Q30Which functional dependency inferences always hold
- 2026 Session 1 · Q31Dependency-preserving decompositions for 1NF, 2NF, 3NF, BCNF
- 2026 Session 1 · Q43Relational algebra equivalent of a tuple calculus join query
- 2026 Session 1 · Q65Number of superkeys with candidate keys {A,B} and {A,C}
- 2026 Session 2 · Q15Match DBMS schema levels with what they describe
- 2026 Session 2 · Q20When two transactions do not conflict on a data item