GATE Computer Science (CS) 2014 Shift 1 Solved Paper

Question : 39 of 65

Marks: +1, -0

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?