The GATE Grind

GATE Databases: Transactions and Concurrency Control – Previous Year Questions

30 GATE previous year questions on Transactions and Concurrency Control (Databases, Computer Science) with answers and explanations, from every paper.

30 questions worth 49 marks in all (11 1-mark, 19 2-mark). Asked between 2007 and 2026, so you can see how the topic has been tested over time.

  1. GATE 2007 CS Q64 (2 marks, Multiple choice) – Which is TRUE about these schedules? S1: r1(X);r1(Y);r2(X);r2(Y);w2(Y);w1(X) S2: r1(X);r2(X);r2(Y);w2(Y);r1(Y);w1(X)
  2. GATE 2009 CS Q43 (2 marks, Multiple choice) – Transactions are T1: R1[x] W1[x] W1[y] and T2: R2[x] R2[y] W2[y]. Which schedules are conflict-serializable? S1: R1[x] R2[x] R2[y] W1[x] W1[y] W2[y]…
  3. GATE 2021 CS (CS2) Q42 (2 marks, Multiple choice) – Schedule S is R2(Y),R1(X),R3(Z),R1(Y),W1(X),R2(Z),W2(Y),R3(X),W3(Z). P: S is conflict-serializable. Q: If T3 commits before T1 finishes, S is…
  4. GATE 2015 CS (CS3) Q51 (2 marks, Multiple choice) – A partial schedule is: Time T1 T2 --- --- --- 1 read(A) 2 write(A) 3 read(C) 4 write(C) 5 read(B) 6 write(B) 7 read(A) 8 commit 9 read(B) T1 fails…
  5. GATE 2015 CS (CS2) Q31 (1 mark, Multiple choice) – A transaction transfers money between accounts x,y: The requirement that x+y remain constant is a constraint of which transaction property?
  6. GATE 2015 CS (CS2) Q39 (2 marks, Multiple choice) – A simple-checkpoint recovery log contains: A crash occurs now. Choose the undo and redo lists.
  7. GATE 2010 CS Q30 (1 mark, Multiple choice) – Which protocols ensure both conflict serializability and freedom from deadlock? I: Two-phase locking. II: Timestamp ordering.
  8. GATE 2010 CS Q52 (2 marks, Multiple choice) – Find the equivalent serial order for this schedule, listed from first operation to last:
  9. GATE 2012 CS Q37 (2 marks, Multiple choice) – P=Q=0 initially. T₁ executes read(P); read(Q); if P==0 then Q:=Q+1; write(Q). T₂ executes read(Q); read(P); if Q==0 then P:=P+1; write(P). Any…
  10. GATE 2017 CS (CS2) Q54 (2 marks, Numerical answer) – Transactions are T₁:r₁(X)w₁(X)r₁(Y)w₁(Y) and T₂:r₂(Y)w₂(Y)r₂(Z)w₂(Z). How many interleavings preserve each transaction’s order and are…
  11. GATE 2016 CS (CS2) Q32 (1 mark, Multiple choice) – For a serializable schedule, precedence-graph vertices represent transactions and directed edges represent conflicts. Which vertex ordering yields an…
  12. GATE 2016 CS (CS2) Q61 (2 marks, Multiple choice) – S = r₂(X); r₁(X); r₂(Y); w₁(X); r₁(Y); w₂(X); a₁; a₂, where r,w mean read/write and a means abort. Which statement is true?
  13. GATE 2014 CS (CS3) Q39 (2 marks, Multiple choice) – Transactions: T1: r1(X); r1(Z); w1(X); w1(Z) T2: r2(Y); r2(Z); w2(Z) T3: r3(Y); r3(X); w3(Y) Schedules: S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y);…
  14. GATE 2014 CS (CS2) Q39 (2 marks, Multiple choice) – For the shown schedule S of T1, T2, T3 and T4, which statement is correct?
  15. GATE 2014 CS (CS1) Q39 (2 marks, Multiple choice) – Three transactions read and write item x using rᵢ and wᵢ. Which schedule is conflict serializable?
  16. GATE 2017 CS (CS1) Q52 (2 marks, Multiple choice) – In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let TS(T 1) and TS(T 2) be the timestamps of…
  17. GATE 2016 CS (CS1) Q32 (1 mark, Multiple choice) – Which one of the following is NOT a part of the ACID properties of database transactions?
  18. GATE 2016 CS (CS1) Q61 (2 marks, Multiple choice) – Consider the following two phase locking protocol. Suppose a transaction T accesses (for read or write operations), a certain set of objects \O 1, , O…
  19. GATE 2019 CS Q21 (1 mark, Multiple choice) – Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable…
  20. GATE 2026 CS (CS2) Q20 (1 mark, Multiple choice) – Consider concurrent execution of two transactions T 1 and T 2 in a DBMS, both of which access a data object A. For these two transactions to not…
  21. GATE 2025 CS (CS2) Q27 (1 mark, Multiple select) – An audit of a banking transactions system has found that on an earlier occasion, two joint holders of account A attempted simultaneous transfers of…
  22. GATE 2025 CS (CS2) Q53 (2 marks, Multiple select) – Consider the database transactions T1 and T2, and data items X and Y. Which of the schedule(s) is/are conflict serializable? Transaction T1: R1(X),…
  23. GATE 2025 CS (CS1) Q15 (1 mark, Multiple choice) – A schedule of three database transactions T 1, T 2, and T 3 is shown. R i(A) and W i(A) denote read and write of data item A by transaction T i, i =…
  24. GATE 2024 CS (CS2) Q19 (1 mark, Multiple choice) – Once the DBMS informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all its…
  25. GATE 2024 CS (CS2) Q27 (1 mark, Multiple select) – Which of the following statements about the Two Phase Locking (2PL) protocol is/are TRUE?
  26. GATE 2024 CS (CS1) Q46 (2 marks, Multiple select) – Consider the read-write schedule S over three transactions T 1,T 2,T 3: S: r 1(z); w 1(z); r 2(x); r 3(y); w 3(y); r 2(y); w 2(x); w 2(y);. Which of…
  27. GATE 2022 CS Q39 (2 marks, Multiple choice) – Let R i(z) and W i(z) denote read and write operations on a data element z by a transaction T i, respectively. Consider the schedule S with four…
  28. GATE 2021 CS (CS1) Q23 (1 mark, Multiple select) – Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the…
  29. GATE 2021 CS (CS1) Q42 (2 marks, Multiple choice) – Let r i(z) and w i(z) denote read and write operations respectively on a data item z by a transaction T i. Consider the following two schedules. S 1:…
  30. GATE 2020 CS Q47 (2 marks, Multiple choice) – Consider a schedule of transactions T 1 and T 2. In time order (RX = Read(X), WX = Write(X)): T1:RA, T2:RB, T2:WB, T1:RC, T2:RD, T1:WD, T2:WC, T1:WB,…