Databases · Transactions and Concurrency Control
Official IIT answer key · IISc Bangalore · Audited Aug 2026
GATE CSE 2016 Set 2 Q22 · MCQ · 1 mark
Key concept
No account needed
Sit 5 related Transactions and Concurrency ControlPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
Across 2012–2026, Transactions and Concurrency Control in GATE CS is heavily weighted towards testing precedence (serialization) graphs for conflict serializability, schedule classification (recoverable, cascadeless, strict), and locking/timestamping protocol mechanics. Questions frequently present interleaved schedules and require students to identify conflict edges, count valid topological orders, or detect recovery anomalies such as dirty reads and cascading rollbacks. Recent exams (2021–2025) feature multiple MSQs testing theoretical invariants of Two-Phase Locking (2PL), deadlock prevention protocols (Wait-Die, Wound-Wait), and real-world ACID violations.
Full Transactions and Concurrency Control guide →Suppose a database schedule S involves transactions T1, , Tn. Construct the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule? (A) Topological order (B) Depth-first order (C) Breadth-first order (D) Ascending order of transaction indices
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
