GateAI
Transactions and Concurrency Control

GATE CSE 2015 Set 3 · Q29

MCQ2 marksMedium

Time

Consider the following partial Schedule SS involving two transactions T1T1 and T2T2. Only the read and the write operations have been shown. The read operation on data item PP is denoted by read(P)read(P) and the write operation on data item PP is denoted by write(P)write(P). Suppose that the transaction T1T1 fails immediately after time instance 9. Which one of the following statements is correct?

GATE CSE 2015 Set 3 Q29 diagram

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: B) Schedule S is non-recoverable and cannot ensure transaction atomicity

Transactions and Concurrency Control

In the given schedule SS:

  • At time instance 2, transaction T1T1 performs write(A)\text{write}(A).

  • At time instance 7, transaction T2T2 performs read(A)\text{read}(A), reading the uncommitted value written by T1T1.

  • At time instance 8, transaction T2T2 performs commit\text{commit}.

A schedule is defined as recoverable if, whenever transaction TjT_j reads a value written by transaction TiT_i, the commit operation of TiT_i appears before the commit operation of TjT_j.

Here, T2T2 reads from uncommitted transaction T1T1 and commits at time 8 while T1T1 has not yet committed. When T1T1 fails after time instance 9, it must be aborted and its updates rolled back to maintain atomicity. However, because T2T2 has already committed (durability), its actions cannot be undone (cannot be rolled back).

Therefore, Schedule SS is non-recoverable and cannot ensure transaction atomicity. Hence, option (B) is correct.

Try the question first, then check your work.

Think the official key or this write-up is wrong?

Report error or challenge

Examiner trap

The misconception this question tests

This Transactions and Concurrency Control previous year question is Q29 of the GATE CSE 2015 Set 3 paper. Find more GATE CSE PYQs on Transactions and Concurrency Control in Databases, or browse all GATE CSE PYQs.

Free diagnostic

Where do you stand for GATE?

Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Transactions and Concurrency Control PYQs now with no account.

One GATE CSE PYQ every morning

An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.

Transactions and Concurrency Control in GATE CSE

Transactions and Concurrency Control has 25 GATE CSE PYQs across 20 papers from 2012 to 2026. 12 of them are 2-mark MCQs like this one, and it is the only one in GATE CSE 2015 Set 3.

How GATE tests Transactions and Concurrency Control

More from GATE CSE 2015 Set 3

Share this solution

A plain-text card for WhatsApp or Telegram study groups.

GateAI solution cardGATE CSE 2015 Set 3 · Q29 · MCQ

Consider the following partial Schedule S involving two transactions T1 and T2. Only the read and the write operations have been shown. The read operation on data item P is denoted by read(P) and the write operation on data item P is denoted by write(P). Suppose that the transaction T1 fails immediately after time instance 9. Which one of the following statements is correct?

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.