For a given schedule S, find out the conflict equivalent serial schedule…

For a given schedule S, find out the conflict equivalent serial schedule derived through topological ordering of precedence

S: r1(x); r2(z); r1(z); r3(x); r3(y); W1(y); W3(y); r2(y); W2(z); W2(y);

  1. A.

    T1, T2, T3

  2. B.

    T3, T2, T1

  3. C.

    T1, T3, T2

  4. D.

    Not conflict serializable

Attempted by 53 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…