GATE Computer Science (CS) 2022 Shift 1 Solved Paper

Question : 38 of 65

Marks: +1, -0

Let R_i(z) and W_i(z) denote read and write operations on a data element z by a transaction T_i, respectively. Consider the schedule S with four transactions.
S: R₄(x)R₂(x)R₃(x)R₁(y)W₁(y)W₂(x)W₃(y)R₄(y)
Which one of the following serial schedules is conflict equivalent to S?