GATE CSE 2025 Session 2 Q53: Which interleavings of T1 and T2 are conflict serializable
- Databases
- 2 marks
- MSQ
- No negative marking
Question
Consider the database transactions T1 and T2, and data items X and Y. Which of the schedule(s) is/are conflict serializable?
| Transaction T1 | Transaction T2 |
|---|---|
| R1(X) | W2(X) |
| W1(Y) | W2(Y) |
| R1(X) | COMMIT(T2) |
| W1(X) | |
| COMMIT(T1) |
Try it: multiple select: one or more correct options
Show answer and explanation
Answer: B (official GATE 2025 final answer key)
Concept used: A schedule is conflict serializable when its precedence graph has no cycle.
First step: For each schedule, add an edge for every pair of conflicting operations (same item, at least one write) in their order, and look for edges both ways between T1 and T2.
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 2025 Session 2 CS question paper and final answer key, organised by IIT Roorkee. 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