GATE 2009 CS – Question 43
Transactions are T1: R1[x] W1[x] W1[y] and T2: R2[x] R2[y] W2[y]. Which schedules are conflict-serializable?
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]
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (C) S3 only
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort