number of conflict serializable schedule

Question

A)  Number of conflict serializable schedules possible

R₄(a) R₂(a) R₃(a) W₁(b)  W₂(a) R₃(b) W₂(b)

B)  NUmber of conflict serializABLE SCHEDULES possible by T1 and T2

T1 : R(a) W(a) R(b) W(b)

T2 : R(a) W(a) R(b) W(b)

Comments

For part a answer is 3.

---

a) 3 b) 2

---

qn( A)instead of conflict serializable what if the question is how many conflict equivalent schedules are possible?

Answer 1

i

 correct me if i done wrong

Comments

@prateek thank you :) but do bear with me for a few doubts

why r2(a) cannot be between w2(a) and w2(b) ?

---

because transaction order should be preserved

---

@Prateek Raghuvanshi nice explanation