Number of conflict serial orderings (with commit) Applied Course FT-1 closed

Question

Consider the following order of transactions:
T2: R(y); T3:W(y); T3: commit; T1: W(y); T1: commit; T2: R(x); T2: W(z); T2: commit; T4: R(y);T4: R(x); T4: commit.

Let the above schedule be S, if S is serializable, then how many conflict serial orderings of S is possible?___________

Comments

@Shubhgupta

why we will not consider the WR conflict of T3 T4 , WW conflict of T1 T2 , WR conflict of  T1 T4 ?

---

i found duplicate of this- https://gateoverflow.in/245417/test-series?show=245683

check and shaik also solved in similar way.

---

please close this duplicate question.