Register

Number of conflict serializable schedules

4,171 views
7 votes
7 votes
Number of conflict serializable schedules in

T1 : R(A) W(A) R(B) W(B)

T2: R(A) W(A) R(B) W(B)
User Avatar

5 Answers

1 votes
1 votes
There could be two serial schedules possible:

S1:  T1 -> T2

S2:  T2 -> T1

For S1, we could have 6 conflict serializable schedules. Same for S2.

So totally we could have 12 conflict serializable schedules.
User Avatar
Page:
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
5
Harsh Saini_1 asked Dec 27, 2023
411 views
Number of Conflict Serializable Schedules
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)$
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)$
User Avatar
2 votes
2 votes
2 answers
6
Balaji Jegan asked Nov 30, 2018
1,848 views
TOTAL CONFLICT SERIALIZABLE SCHEDULES
Two transactions T1 and T2 are given as T1:r1(A) w1(A) r1(B) w1(B) r1(C) w1(C) T2:r2(B) w2(B) r2(C) w2(C) r2(D) w2(D) The total number of conflicts serializable schedules that can be formed by T1 and T2 are _____
Two transactions T1 and T2 are given asT1:r1(A) w1(A) r1(B) w1(B) r1(C) w1(C)T2:r2(B) w2(B) r2(C) w2(C) r2(D) w2(D)The total number of conflicts serializable schedules th...
User Avatar
1 votes
1 votes
1 answer
7
rajoramanoj asked Jan 7, 2018
531 views
conflict serializable schedules
How many concurrent schedules are conflict serializable of given transactions T1 and T2 :
How many concurrent schedules are conflict serializable of given transactions T1 and T2:
User Avatar
5 votes
5 votes
1 answer
8
radha gogia asked Oct 19, 2015
2,974 views
How many conflict serializable schedules are possible ?
The transactions $T1$ and $T2$ are given as follows: $T1$: $R1(A)$ $W1(A)$ $R1(B)$ $W1(B)$ $T2$ : $R2(B)$ $W2(B)$ $R2(C)$ $W2(C)$ The total number of conflicts serializable that can be formed by $T1$ and $T2$ are Answer :20 (incorrect) The correct answer is 14
The transactions $T1$ and $T2$ are given as follows:$T1$: $R1(A)$ $W1(A)$ $R1(B)$ $W1(B)$$T2$ : $R2(B)$ $W2(B)$ $R2(C)$ $W2(C)$The total number of conflicts serializable ...
User Avatar
Link Copied!