0 votes 0 votes Find the number of all possible conflict-equivalent schedules to the following serial schedule: r1(X);w1(Y);w1(Z);r2(X);w2(Y);w2(Z); where ri(A) means ith transaction reads resource A and wi(A) means ith transaction writes resource A. Jhunjhunuwala asked Feb 1, 2017 Jhunjhunuwala 186 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I am getting T1->T2 only. Purvi Agrawal answered Mar 12, 2017 Purvi Agrawal comment Share Follow See all 0 reply Please log in or register to add a comment.