Multiple choice

Consider two transactions T1 and T2 and four schedules S1, S2, S3 and 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 is/are conflict-serializable?

  1. Both S1 and S2

  2. Both S2 and S3

  3. Only S3

  4. Only S4

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation