Question 5193 – UGC NET CS 2012 Dec-Paper-2
November 5, 2023Question 8153 – Transactions
November 6, 2023Question 9288 – Transactions
Consider the following schedules involving two transactions. Which one of the following statements is TRUE?
- 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)
Correct Answer: C
Question 11 Explanation:
In precedence graph of S1 since cycle is formed so not conflict serializable.
But in precedence graph of S2 No cycle is formed so it is conflict serializable.
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.
Subscribe
Login
0 Comments