1,120 views
2 votes
2 votes
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 _______.

2 Answers

3 votes
3 votes
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.
1 votes
1 votes

ans is 1

Related questions

0 votes
0 votes
1 answer
1
Bharat patra asked Nov 25, 2018
1,871 views
Consider the following schedule :S:r1(A);w1(B);r2(A);w2(B);r3(A);w3(B);Here ri(X) denotes read on data item X and wi(X) denoted write on data item X .The total number of ...
0 votes
0 votes
2 answers
3
Na462 asked May 18, 2018
605 views
Consider the following schedule: How many serial schedules view equal to schedule (S)?Answer: 10Approach Please??
2 votes
2 votes
1 answer
4