764 views
1 votes
1 votes

1 Answer

0 votes
0 votes
How about using this formula : -

For $n$ transactions $T_1$, $T_2$, $T_3$,...,$T_n$ having $n_1$, $n_2$, $n_3$, ... $n_n$ instructions each

\[ \frac {(n_1+n_2+n_3+...+n_n)!}{n_1 ! n_2 ! n_3! .... n_n!}-n!\]

 

So according to questing answer should be 68

Related questions

5 votes
5 votes
1 answer
1
A_i_$_h asked Oct 10, 2017
1,903 views
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(...
3 votes
3 votes
2 answers
2
Surya Dhanraj asked Aug 30, 2017
691 views
Find number of conflict serializable schedule for the following transactionT1: R1(a)w1(a)R1(b)w1(b)T2: R2(a)w2(a)R2(b)w2(b)Plzz help me ...how to solve these questions......
2 votes
2 votes
0 answers
4
susgir2 asked Dec 31, 2018
536 views
My question, does abort in T2 makes this schedule conflict serializable? as the effect of T2 will be null. T1: Rx T2: Wx T1: Wx T2: ABORT T1: COMMITRx – read item x.Wx...