Question

Consider the following transaction schedule:

r₁(X), r₂(X), r₃(X), r₁(Y), w₂(Z), r₃(Y), w₃(Z), w₁(Y)

This schedule is conflict-equivalent to some or all serial schedules. Determine which serial schedules it is conflict-equivalent to, and then identify a true statement from the list below.

Select one:

a. The schedule is conflict-equivalent to (T₃, T₁, T₂)

b. The schedule is not serial

c. The schedule is conflict-equivalent to (T₃, T₂, T₁)

d. The schedule is conflict-equivalent to (T₂, T₃, T₁)

e. The schedule is conflict-equivalent to (T₁, T₃, T₂)

Answer 1

Answer- d. The schedule is conflict-equivalent to (T₂, T₃, T₁)

Explanation:

When the Creating Precedence graph following the problem than T2 happens before the T3 following the order of Z(writes) and T3 happens before reads or writes Y. So the serial order is - T2,T3,T1.
The schedule is conflict-equivalent to (T₂, T₃, T₁)