521 views
1 votes
1 votes
Two transaction T1 and T2 are given as follows

T1: R1(A),W1(A),R1(B),W1(B)

T2: R2(B),W2(B),R3(C),W3(C)

Number of conflict serializable be ____________

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Harsh Saini_1 asked Dec 27, 2023
333 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
303 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)
2 votes
2 votes
1 answer
3
srestha asked Jan 24, 2018
796 views
It is not conflict serializable, So, why not option A) ??
0 votes
0 votes
0 answers
4