edited by
17,932 views

3 Answers

Best answer
17 votes
17 votes
Total operations = 2+3+4=9
Total no. of concurrent schedules : 9C2 * 7C3  = 1260

1. We need to maintain order of operations of an individual transaction [or it won't be a schedule] in the final interleaved schedule.
2. Out of the 9 possible positions we choose 2 places for T1 and place it operations sequentially , then we choose 3 places for T2 and place its operation sequentially , The remaining 4 places are used for T3 .
selected by

Related questions

1 votes
1 votes
1 answer
1
techbrk3 asked Nov 9, 2017
1,651 views
The schedule is given below. Find out the category of the scheduleS: R1(X),R2(Z)R1(Z),R3(X) W1(X) W3(Y) R2(Y) W2(Z) W2(Y) C1 C2 C3Recoverable scheduleConflict Serializabl...
2 votes
2 votes
1 answer
2
techbrk3 asked Nov 9, 2017
1,635 views
The time stamp of two transactions T1 and T2 are 10 and 15 respectively. Consider the following schedule with T1 and T2 operations.S1:r1(x),w1(x),r2(x),w2(x),r1(y),w1(y),...
17 votes
17 votes
1 answer
3
nilamd asked Dec 21, 2015
4,528 views
Consider the following Two Transactions.A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ?$51$$52$$55$$56$ B) How many cascadeless recoverable s...