Every read sees a value from before these transactions’ writes, so there is no dirty-read dependency. Neither abort forces the other through a read-from relationship: no cascading abort occurs, C. The overwrite w₂(X) follows uncommitted w₁(X), so the schedule is not strict.
More Transactions and Concurrency Control questions
GATE 2017 CS (CS2) Q54– Transactions are T₁:r₁(X)w₁(X)r₁(Y)w₁(Y) and T₂:r₂(Y)w₂(Y)r₂(Z)w₂(Z). How many…
GATE 2012 CS (CS1) Q37– P=Q=0 initially. T₁ executes read(P); read(Q); if P==0 then Q:=Q+1; write(Q). T₂ executes…
GATE 2010 CS (CS1) Q30– Which protocols ensure both conflict serializability and freedom from deadlock? I:…
GATE 2010 CS (CS1) Q52– Find the equivalent serial order for this schedule, listed from first operation to last:
GATE 2015 CS (CS2) Q31– A transaction transfers money between accounts x,y: The requirement that x+y remain…
GATE 2015 CS (CS2) Q39– A simple-checkpoint recovery log contains: A crash occurs now. Choose the undo and redo…