T1: r1(X), w1(X), r1(Y), w1(Y)

T2: r2(Y), w2(Y), r2(Z), w2(Z)

finding conflict equivalents from T1 to T2 ===> it means first T1 started then T2.

conflict serializable schedule means, your schedule should conflict equivalent to serial schedule.

what are the conflicting operations between T1 and T2 ?

i) T1 : R(y) with T2: W2(y)

ii) T1 : W1(y) with T2: R2(y) and

iii) T1 : W1(y) with T2: W2(y)

So, ( you are interested in T1 -> T2 ) ===> **T1 : W1(y)** should be before **T2: R2(y)** , so howmany combinations remaining can have ?

only one schedule you can have :- r1(X), w1(X), r1(Y), __ w1(Y), r2(Y),__ w2(Y), r2(Z), w2(Z).

i know, i explained easy one, try to get the other part, read the answer 2-3 times if you didn't get it !

after that Still if you didn't get comment !!