GATE Computer Science (CS) 2021 Shift 2 Solved Paper

© examsiri.com
Question : 42 of 65
 
Marks: +1, -0
Let S be the following schedule of operations of three transactions T1, T2 and T3 in a relational database system:
R2(Y), R1(X), R3(Z), R1(Y), W1(X), R2(Z), W2(Y), R3(X), W3(Z)
Consider the statements P and Q below:
P: S is conflict-serializable.
Q: If T3 commits before T1 finishes, then S is recoverable.
Which one of the following choices is correct?
Go to Question: