closed by
273 views
1 votes
1 votes
closed as a duplicate of: data base management system

correct answer?

closed by

Related questions

4 votes
4 votes
1 answer
2
rahul sharma 5 asked Jul 12, 2017
1,200 views
Consider thw following transactions:-T1 :- r1(A) w1(A) r1(B) w1(B)T1 :- r2(A) w2(A) r2(B) w2(B)a) Number of schedules serializable as t1->t2?b) Number of schedules serial...
0 votes
0 votes
1 answer
3
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)$