No of operation to make schedule non serializable.

Question

Consider the following schedule

S: r₁(B);w₂(C);????;w₃(C);w₁(D);w₂(E)

The possible operations on S are read, write, Increment, Multiply respectively (Increment,  Multiply by constant)

1. How many actions can be placed in the given schedule S such that S become non-serializable as T1→T2

a) 5 b) 7 c) 9 d)11

2. How many actions can be placed in the given schedule S such that S become non-serializable as T2→T1

a) 5 b) 7 c) 9 d)11

Comments

i think 4 is the answer in both cases , to make it non serizale from t1->t2 we have to put an conflicting instruction in such a way that the edge comes from T2->T1.

4 such cases are coming. what is the answer.???

---

Its number of operations.