RW, WR, WW on the same item by different transactions
Conflict serializable
precedence graph has no cycle
Serial orders of n transactions
n! (for counting equivalent serial schedules use topological orders)
Schedule hierarchy
strict ⊂ cascadeless ⊂ recoverable; conflict SR ⊂ view SR
Timestamp read rule
abort if TS(Ti) < WTS(X) else RTS = max(RTS, TS(Ti))
Timestamp write rule
abort if TS(Ti) < RTS(X) or TS(Ti) < WTS(X) (ignore the latter with Thomas); else WTS = TS(Ti)
Lock compatibility
S–S yes; S–X, X–S, X–X no
What GATE asks from this
Question types seen repeatedly in past papers. More stars means more frequent.
★★★
Is this schedule conflict serializable? How many serial orders?
Draw the precedence graph; count topological orders.
★★★
Classify as recoverable / cascadeless / strict
Check reads and writes against commit positions.
★★★
Statements about 2PL, strict 2PL, deadlock
Know what each guarantees and what it allows.
★★★
Timestamp ordering / Thomas write rule
Simulate RTS/WTS; find the aborted transaction.
★★★
Log-based recovery: what to redo and undo
Use the checkpoint and commit records.
Ratings are approximate, based on recurring patterns in past GATE CSE papers.
Previous year questions
15 real questions from the official GATE CSE papers (2012 to 2025), newest first, each with the official answer key and a worked solution. Questions are the property of the GATE organising institutes; this copy is for your personal study.
15 questions · 0 correct of 0 attempted · marks 0 / 23
Year:
GATE 2025 CS1 · Q15MCQ1 mark
A schedule of three database transactions T1, T2 and T3 is shown. Ri(A) and Wi(A) denote read and write of data item A by transaction Ti. The transaction T1 aborts at the end. Which other transaction(s) will be required to be rolled back? Schedule: R1(X) W1(Y) R2(X) R2(Y) R3(Y) ABORT(T1).
GATE 2025 CS2 · Q27MSQ1 mark
An audit of a banking transactions system found that two joint holders of account A attempted simultaneous transfers of Rs. 10000 each from account A to account B. Both transactions read the same value, Rs. 11000, as the initial balance in A and were allowed to go through. B was credited Rs. 10000 twice. A was debited only once and ended up with a balance of Rs. 1000. Which of the following properties is/are certain to have been violated by the system?
One or more options may be correct. Select all that apply, then submit.
GATE 2025 CS2 · Q53MSQ2 marks
Consider the database transactions T1 and T2, and data items X and Y. T1: R1(X) W1(Y) R1(X) W1(X) COMMIT(T1). T2: W2(X) W2(Y) COMMIT(T2). Which of the schedule(s) is/are conflict serializable? (A) R1(X), W2(X), W1(Y), W2(Y), R1(X), W1(X), COMMIT(T2), COMMIT(T1). (B) W2(X), R1(X), W2(Y), W1(Y), R1(X), COMMIT(T2), W1(X), COMMIT(T1). (C) R1(X), W1(Y), W2(X), W2(Y), R1(X), W1(X), COMMIT(T1), COMMIT(T2). (D) W2(X), R1(X), W1(Y), W2(Y), R1(X), COMMIT(T2), W1(X), COMMIT(T1).
One or more options may be correct. Select all that apply, then submit.
GATE 2024 CS2 · Q19MCQ1 mark
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 changes are reflected on disk. This property is called
GATE 2024 CS2 · Q27MSQ1 mark
Which of the following statements about the Two Phase Locking (2PL) protocol is/are TRUE?
One or more options may be correct. Select all that apply, then submit.
GATE 2024 CS1 · Q46MSQ2 marks
Consider the following read-write schedule S over three transactions T1, T2 and T3: S: r1(z); w1(z); r2(x); r3(y); w3(y); r2(y); w2(x); w2(y). Which of the following transaction schedules is/are conflict equivalent to S?
One or more options may be correct. Select all that apply, then submit.
GATE 2021 Set 1 · Q13MSQ1 mark
Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery. Which of the following statements is/are correct?
One or more options may be correct. Select all that apply, then submit.
GATE 2021 Set 1 · Q32MCQ2 marks
Let ri(z) and wi(z) denote read and write operations respectively on a data item z by a transaction Ti. Consider the two schedules S1: r1(x) r1(y) r2(x) r2(y) w2(y) w1(x) and S2: r1(x) r2(x) r2(y) w2(y) r1(y) w1(x). Which one of the following options is correct?
GATE 2020 · Q37MCQ2 marks
Consider a schedule of transactions T1 and T2, in time order: RA(T1), RB(T2), WB(T2), RC(T1), RD(T2), WD(T1), WC(T2), WB(T1), Commit(T1), Commit(T2). 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? (A) RB2 WB2 RD2 RA1 RC1 WD1 WB1 WC2 Commit1 Commit2. (B) RA1 RC1 WD1 WB1 RB2 WB2 RD2 WC2 Commit1 Commit2. (C) RA1 RC1 WD1 RB2 WB2 RD2 WB1 WC2 Commit1 Commit2. (D) RB2 WB2 RD2 WC2 RA1 RC1 WD1 WB1 Commit1 Commit2.
GATE 2019 Set 2 · Q11MCQ1 mark
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?
GATE 2017 Set 1 · Q42MCQ2 marks
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. Besides, T1 holds a lock on the resource R, and T2 has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp. if TS(T2) < TS(T1) then T1 is killed else T2 waits. Assume any transaction that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?
GATE 2016 Set 1 · Q22MCQ1 mark
Which one of the following is NOT a part of the ACID properties of database transactions?
GATE 2016 Set 1 · Q51MCQ2 marks
Consider the following two phase locking protocol. Suppose a transaction T accesses (for read or write operations), a certain set of objects {O1, ..., Ok}. This is done in the following manner. Step 1: T acquires exclusive locks to O1, ..., Ok in increasing order of their addresses. Step 2: The required operations are performed. Step 3: All locks are released. This protocol will
GATE 2014 Set 1 · Q29MCQ2 marks
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable? (A) r1(x); r2(x); w1(x); r3(x); w2(x). (B) r2(x); r1(x); w2(x); r3(x); w1(x). (C) r3(x); r2(x); r1(x); w2(x); w1(x). (D) r2(x); w2(x); r3(x); r1(x); w1(x).
GATE 2012 Code A · Q27MCQ2 marks
Consider the following transactions with data items P and Q initialized to zero: T1:
read(P);
read(Q);
if P = 0 then Q := Q + 1; write(Q). T2:
read(Q);
read(P);
if Q = 0 then P := P + 1; write(P). Any non-serial interleaving of T1 and T2 for concurrent execution leads to
Common traps
Add an edge for every conflicting pair, but only between different transactions and only when at least one op is a write.
2PL schedules are serializable but can deadlock; strict 2PL does not prevent deadlock.
A serializable schedule need not be recoverable, and vice versa.
The number of serial orders equal to a schedule is the number of topological orderings, not always 1.