retagged by
262 views
1 votes
1 votes

Given below are some transaction schedules that involve three transactions $T1 \  T2 \ T3$:

$\textbf{Schedule 1:}$

$T2 : Rx , T2 : Ry , T1 : Wx , T3 : Wy , T3 : Wz , T2 : Wz , T1 : Rz , T2 : Wy  $

$\textbf{Schedule 2:}$

$T2 : Rx , T2 : Wy , T3 : Ry , T3 : Wx ,  T1 : Wy , T3 : Rx , T1 : Ry , T2 : Wy$

$\textbf{Schedule 3:}$

$T1 : Rx , T2 : Ry , T3 : Wy , T2 : Rz ,  T3 : Rz , T1 : Wz , T1 : Wy , T2 : Wy$

$\textbf{Schedule 4:}$

$T1 : Rx , T3 : Wy , T2 : Rz , T3 : Rz ,  T1 : Wy , T2 : Wx , T1 : Ry , T2 : Wz$

Which of the above given schedules is conflict serializable?

  1. Schedule $1$
  2. Schedule $2$
  3. Schedule $3$
  4. Schedule $4$
retagged by

1 Answer

1 votes
1 votes
When we draw precedence graphs all of them are cyclic. So none of the given schedules is CSS.
Answer:

Related questions

3 votes
3 votes
2 answers
1
2 votes
2 votes
1 answer
2
Bikram asked Aug 26, 2017
318 views
Consider the following transaction involving two bank accounts $A$ and $B$.$\begin{array}{|l|} \hline \text{read(A);} \\ \hline A:=A-250; \\ \hline \text{write(A);} \\ \...
1 votes
1 votes
1 answer
3
Bikram asked Aug 26, 2017
294 views
A schedule with two transactions T1 and T2 is as mentioned below:$\begin{array}{|c|c|} \hline T1 & T2 \\ \hline \text{read(A)} & {} \\ \hline \text{write(A)} & {} \\ \hl...