number of schedules conflict equivalent schedule

Question

Consider the following schedule:

S : w₁(A) w₁(B) r₂(A) w₂(B) r₃(A) w₃(B)

The number of schedules conflict equivalent are __________ .

Comments

8?..

---

plz explain

---

$8$ different schedules possible?

---

Yup, that's the answer given. How?

---

I used topological ordering and got 8 as answer .
other approach is given in this question :

https://gateoverflow.in/195950/conflict-serializability :

---

How did topological ordering give you 8??

This would be the graph, right? This gives only one way T1---> T2---> T3.

---

@sumaiya  
this will give conflict equvalent serial schedule

---

instructions are numbered 1-6  in according to the order mentioned in the question.

123456

123546

125346

132456

132546

135246

152346

153246

---

how??

---

@Sumaiya23

its asking for conflict equivalent and not conflict serializable.

---

see the first comment under this qsn - https://gateoverflow.in/10299/conflict-equivalent

---

Similar questions:

https://gateoverflow.in/118640/gate2017-2-44

https://gateoverflow.in/10299/conflict-equivalent

https://gateoverflow.in/37446/number-of-conflict-serializible-schedules

Answer 1

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

Comments

oh k maybe I am wrong...

---

I think this is the correct approach 

https://gateoverflow.in/10299/conflict-equivalent

---

thanks

Answer 2

I think this should do it . 

 

Comments

@  Pratyush Priyam Kuan If you see conflict equivalent schedule for this it will be T1 -> T2 -> T3, So how can we take operation 5 before T2 .

---

@sags.sharma position of 5 will not affect the conflict serializability. please check..

Answer 3

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 4

let me know if there is any mistake-