GATE 2014 CS (CS2) – Question 39
For the shown schedule S of T1, T2, T3 and T4, which statement is correct?
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (C) Both conflict serializable and recoverable
Explanation
Conflicts yield T2→T3,T2→T1,T3→T1 and edges from these writers/readers toward T4; no edge returns to create a cycle. T4 reads only after the relevant T1 and T2 commits; other reads do not consume uncommitted writes. Thus **both conflict-serializable and recoverable,C**.