Consider the transactions T1, T2, T3 with the following schedule S: S : T1:…

Consider the transactions T1, T2, T3 with the following schedule S:
S : T1: Read (x); T2: Read (z); T1:Read(z);
T3:Read(x);T3:Read(y); T1:Write(x);
T3:Write (y);T2:Read(y);
T2:Write(z); T2:Write(y)
If the schedule S is serializable, the equivalent serial schedule is ____.

  1. A.

    T2,T1,T3

  2. B.

    T3, T1, T2

  3. C.

    T1,T2,T3

  4. D.

    it cannot be decided

Attempted by 143 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…