retagged by
1,223 views
3 votes
3 votes
Find the number of conflict equivalent schedule:

$r_{1}\left ( x \right ),w_{1}\left ( y \right ),w_{1}\left ( z \right ) , r_{2}\left ( x \right ),w_{2}\left ( y \right ),w_{2}\left ( z \right )$
retagged by

1 Answer

Best answer
2 votes
2 votes

7 is right

selected by

Related questions

1 votes
1 votes
0 answers
1
Anup patel asked Dec 26, 2017
439 views
0 votes
0 votes
1 answer
3
Harsh Saini_1 asked Dec 27, 2023
390 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
4
sambey4 asked Oct 16, 2021
315 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)