Correct answer: (B) The schedule is nonrecoverable and cannot ensure transaction atomicity
Explanation
T2 reads A written by uncommitted T1 and then commits at time eight. T1 subsequently fails, invalidating a value already used by committed T2. Recoverability requires a reader to commit only after the writer it depends on commits; that condition is violated. Therefore the schedule is nonrecoverable, B.
More Transactions and Concurrency Control questions
GATE 2021 CS (CS2) Q42– Schedule S is R2(Y),R1(X),R3(Z),R1(Y),W1(X),R2(Z),W2(Y),R3(X),W3(Z). P: S is…
GATE 2026 CS (CS2) Q20– Consider concurrent execution of two transactions T 1 and T 2 in a DBMS, both of which…
GATE 2025 CS (CS1) Q15– A schedule of three database transactions T 1, T 2, and T 3 is shown. R i(A) and W i(A)…
GATE 2025 CS (CS2) Q27– An audit of a banking transactions system has found that on an earlier occasion, two joint…
GATE 2025 CS (CS2) Q53– Consider the database transactions T1 and T2, and data items X and Y. Which of the…
GATE 2024 CS (CS1) Q46– Consider the read-write schedule S over three transactions T 1,T 2,T 3: S: r 1(z); w 1(z);…