1.5k views

Consider the following schedules involving two transactions. Which one of the following statements is TRUE?

• $S_1 :r_1(X); r_1(Y); r_2(X); r_2(Y); w_2(Y); w_1(X)$
• $S_2 :r_1(X); r_2(X); r_2(Y); w_2(Y); r_1(Y); w_1(X)$
1. Both $S_1$ and $S_2$ are conflict serializable.

2. $S_1$ is conflict serializable and $S_2$ is not conflict serializable.

3. $S_1$ is not conflict serializable and $S_2$ is conflict serializable.

4. Both $S_1$ and $S_2$ are not conflict serializable.

For $S1$ : it is not conflict serializable

for $S2$ : it is conflict serializable

edited
You can make a Precedence graph for the two schedules.And check for the conflicts pairs making a Cycle.

S1 makes a cycle. T1-->T2 and T2-->T1. And hence is not Conflict Serializable.

S2 does not makes cycle and has transition from T2-->T1 only. And hence is Conflict Serializable.

Conflict Pairs: RW, WR, WW.
Ans - Option C

In S1: RW conflict from 1-2 and 2-1 so It is not C.S.

In S2: RW conflict AND WR conflict from 2-1 only so it is C.S.
OPTION IS A
OPTION IS B IS APPROPIATE ONE