Databases · Transactions and Concurrency Control
Official IIT answer key · IIT Madras · Audited Aug 2026
GATE CSE 2019 Q11 · 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 →Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. II. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable schedules that are not conflict serializable. Which of the above statements is/are TRUE?
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.
