1,921 views
1 votes
1 votes
T1: r1(A) r1(B) w1(B)

T2:r2(A) r2(B) w2(B)

1)how many concurrent schedules between t1 and t2?

2) how many non serial achedule are serializable?

3) how many schedules serializable as T1-->T2

Am not getting how to find all these. please someone help me.

thanku in advance

2 Answers

1 votes
1 votes

.............

0 votes
0 votes
1.There will be 20 schedules.....total schedules possible will be 6!/3!3!....that is 20...but as concurrent schedules are non serial schedules.....we will have 18 as the answer.......

2.There will be 6 non serial schedules that will be serializable......

3.There will be 4 schedules serializable as t1->t2
edited by

Related questions

1 votes
1 votes
1 answer
1
aaru14 asked Nov 3, 2017
196 views
A B+ tree of order P is a tree in which each internal node has between p to 2p keys the root has between 1 to 2p keys what is the maximum number of internal nodes in B+ t...
1 votes
1 votes
2 answers
2
aaru14 asked Nov 1, 2017
635 views
consider the following transactionsT1:r1(A)w1(A)r1(B)w1(B)T2:r2(B)w2(B)r2(A)w2(A)a)how many schedules serializable asT1 >T2what this question is asking??
0 votes
0 votes
0 answers
3
eyeamgj asked Dec 4, 2018
251 views
what is the answr of 164 .????.i m getting none of these…..