Time-Complexity
October 22, 2023JNU 2018-1 PhD CS
October 22, 2023Database-Management-System
| Question 14 |
Let S be the following schedule of operations of three transactions T1, T2 and T3in 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 T3commits before T1finishes, then S is recoverable.
Which one of the following choices is correct?
| P is true and Q is false. | |
| Both P and Q are false. | |
| Both P and Q are true. | |
| P is false and Q is true. |
Question 14 Explanation:
Correct Answer: A
Question 14 Explanation: