Database-Management-System
August 29, 2024Database-Management-System
August 29, 2024UGC NET CS 2017 Jan- paper-3
|
Question 7
|
Consider following schedules involving two transactions:
S1 : r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X)
S2 : r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X)
Which of the following statement is true?
|
Both S1 and S2 are conflict serializable.
|
|
|
S1 is conflict serializable and S2 is not conflict serializable.
|
|
|
S1 is not conflict serializable and S2 is conflict serializable.
|
|
|
Both S1 and S2 are not conflict serializable.
|
Question 7 Explanation:
Correct Answer: C
Question 7 Explanation: