Open In App

UGC-NET | UGC NET CS 2017 Jan – III | Question 7

Like Article
Like
Save Article
Save
Share
Report issue
Report

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?
(A) Both S1 and S2 are conflict serializable.
(B) S1 is conflict serializable and S2 is not conflict serializable.
(C) S1 is not conflict serializable and S2 is conflict serializable.
(D) Both S1 and S2 are not conflict serializable.


Answer: (C)

Explanation: 7
S1 is not conflict serializable and S2 is conflict serializable.
So, option (C) is correct.

Quiz of this Question


Last Updated : 02 Apr, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads