Consider the following read-write schedule $S$ over three transactions $T_1$, $T_2$, and $T_3$, where the subscripts in the schedule indicate transaction IDs: $$S: r_1(z); w_1(z); r_2(x); r_3(y); w_3(y); r_2(y); w_2(x); w_2(y);$$ Which of the following transaction schedules is/are conflict equivalent to $S$ ?

Consider the following read-write schedule S over three transactions T1, T2, and T3, where the subscripts in the schedule indicate transaction IDs: S: r1(z); w1(z); r2(x); r3(y); w3(y); r2(y); w2(x); w2(y); Which of the following transaction schedules is/are conflict equivalent to S ?

Topic-wise GATE CS PYQs with verified steps