Consider two transactions T1 and T2, and four schedules S1, S2, S3, S4 of T1…

PYQ GATE 2009

Consider two transactions T1 and T2, and four schedules S1, S2, S3, S4 of T1 and T2 as given below:

T1 = R1[X] W1[X] W1[Y]
T2 = R2[X] R2[Y] W2[Y]
S1 = R1[X] R2[X] R2[Y] W1[X] W1[Y] W2[Y]
S2 = R1[X] R2[X] R2[Y] W1[X] W2[Y] W1[Y]
S3 = R1[X] W1[X] R2[X] W1[Y] R2[Y] W2[Y]
S4 = R2[X] R2[Y] R1[X] W1[X] W1[Y] W2[Y]

Which of the above schedules are conflict-serializable?

  1. A.

    S1 and S2

  2. B.

    S2 and S3

  3. C.

    S3 only

  4. D.

    S4 only

Attempted by 199 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…