Register

number of searializable schedule

213 views
1 votes
1 votes

Consider following transactions

T1: R1(a), Wa (a), R1 (b), W1 (b)

T2 : W2 (b), W2 (a)

The number of non-serial schedules between T1 and T2 which are serializable __________ .

User Avatar

1 Answer

0 votes
0 votes
Possible schedules = 6!/(4! *2!) = 15 total schedules Serial + Non Serial

Serial Schedules = 2! = 2

Non Serial Schedules = 15-2 = 13
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Sumeet Sarda asked Dec 20, 2018
787 views
Number of Conflict Serializable Schedule
User Avatar
0 votes
0 votes
1 answer
2
utpal podder asked Sep 17, 2018
996 views
number of recoverable schedule possible
if transactions are T1:r(A),w(A),r(B),w(B),c T2: r(A),r(B),c then howmany recoverable schedule possible over T1,T2?
if transactions are T1:r(A),w(A),r(B),w(B),c T2: r(A),r(B),cthen howmany recoverable schedule possible over T1,T2?
User Avatar
0 votes
0 votes
0 answers
3
Rohit Kumar 2 asked Sep 9, 2018
345 views
number of recoverable schedule
someone please give the video solution of this question or give a detailed solution. how to approach this kind of question. you are welcome.
someone please give the video solution of this question or give a detailed solution. how to approach this kind of question. you are welcome.
User Avatar
5 votes
5 votes
1 answer
4
A_i_$_h asked Oct 10, 2017
1,947 views
number of conflict serializable schedule
A) Number of conflict serializable schedules possible R4(a) R2(a) R3(a) W1(b) W2(a) R3(b) W2(b) B) NUmber of conflict serializABLE SCHEDULES possible by T1 and T2 T1 : R(a) W(a) R(b) W(b) T2 : R(a) W(a) R(b) W(b)
A) Number of conflict serializable schedules possibleR4(a) R2(a) R3(a) W1(b) W2(a) R3(b) W2(b)B) NUmber of conflict serializABLE SCHEDULES possible by T1 and T2T1 : R(...
User Avatar
Link Copied!