Consider the following schedules involving three transactions: S₁: r₁(x),…

Consider the following schedules involving three transactions:

S₁: r₁(x), r₂(z), r₁(z), r₃(x), r₃(y), w₁(x), w₃(y), r₂(y), w₂(z), w₂(y)

S₂: r₁(x), r₂(z), r₁(z), r₃(x), r₃(y), w₁(x), w₂(z), w₃(y), w₂(y)

Which of the following schedules is conflict serializable?

  1. A.

    Only S₁

  2. B.

    Both S₁ and S₂

  3. C.

    Only S₂

  4. D.

    None of the above

Attempted by 25 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…