Redirected
7,081 views
8 votes
8 votes

Consider the following schedule:

S : w1(A) w1(B) r2(A) w2(B) r3(A) w3(B)

The number of schedules conflict equivalent are __________ .

5 Answers

Best answer
14 votes
14 votes

............................

edited by
6 votes
6 votes

I think this should do it . 

 

1 votes
1 votes
you can arrange R3 at 4 places and R2 at 2 places   

 so total 8 way possible   as there is no dependency between R2 and R4
Answer:

Related questions

0 votes
0 votes
1 answer
2
Harsh Saini_1 asked Dec 27, 2023
332 views
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$$T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$$T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
0 votes
0 votes
0 answers
3
Ayush Upadhyaya asked Oct 11, 2018
834 views
How many Conflict Serializable and View serializable schedules for the Schedule given below$S:r_1(A),w_1(B),w_1(C),r_2(A),w_2(B),w_2(C)$To both my answer comes to be 7.Is...
3 votes
3 votes
4 answers
4
Nandkishor3939 asked Jan 18, 2019
2,256 views
how many view equivalent schedules are possible for the Sch given below: