ME test

Question

Consider the following schedule

S : R₂(A), R₁(A), W₁(C), R₃(C), W₁(B), R₄(B), W₃(A), R₄(C), W₂(D), R₂(B), W₄(A), W₄(B)

What is the number of Serial Schedules which are equal to Schedule S but not conflict equivalent to Schedule S?

A) 0              B) 1                C) 2                D) 3

Answer 1

Answer is 1.

I think T2  -> T1 -> T3  -> T4 is View serializable.

It is equal to Schedule S but not conflict equivalent to Schedule S