799 views
2 votes
2 votes

It is not conflict serializable, So, why not option A) ??

1 Answer

0 votes
0 votes
$T_1 :\color{Red}{r_1(x)}...:\color{blue}{w_1(z)}$

$T_2 :\color{blue}{r_1(z)}...\color{Red}{w_1(x)}$

$\Rightarrow$   Same coloured operation on variables are conflicting therefore only serial schedule is possible so conflict serializability is not possible.
$\Rightarrow$   $\therefore$  Any non serial schedule will form deadlock because $2$pl maintain seriablizability and this schedule is not even possible to have interleaved operation.

Related questions

0 votes
0 votes
1 answer
1
Harsh Saini_1 asked Dec 27, 2023
334 views
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$$T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$$T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
0 votes
0 votes
1 answer
2
sambey4 asked Oct 16, 2021
304 views
Find Total no of conflict serializable and view serializableT1: R1(A) W1(A) R1(B) W1(B)T2: R2(A) W2(A) R2(B) W2(B)
1 votes
1 votes
0 answers
3
srestha asked Jan 3, 2018
523 views
Two transaction T1 and T2 are given as followsT1: R1(A),W1(A),R1(B),W1(B)T2: R2(B),W2(B),R3(C),W3(C)Number of conflict serializable be ____________
0 votes
0 votes
0 answers
4