MadeEasy Subject Test: Databases - Transactions

Question

Consider the following schedule
S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A)
The number of schedules equal to given schedule(s) which not conflict equal to
schedule(s) are _______.

Answer 1

This is just similar to one of the ques previously asked. I have take d solution from there. Also for more information kindly refer d link after d answer. 

Please check the solution:

Draw the precedence graph:

1 -- 2 -- 3--4--5--6 comes out to be order of dependency. So, only one conflict equivalent schedule possible.

Total schedules possible with 6 transactions = 6!

So 6! -1 are not conflict equivalent with given graph.

https://gateoverflow.in/103501/madeeasy-test-series