edited by
279 views

1 Answer

1 votes
1 votes

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

Related questions

1 votes
1 votes
0 answers
1
2 votes
2 votes
1 answer
2