Q29

MCQ2 marks, −0.67

Let $\textit{R}_{i}(z)$ and $\textit{W}_{i}(z)$ denote read and write operations on a data element $z$ by a transaction $\textit{T}_{i},$ respectively. Consider the schedule $\textit{S}$ with four transactions. $S: \; R_{4}(x) R_{2}(x) R_{3}(x)R_{1}(y) W_{1}(y) W_{2}(x) W_{3}(y) R_{4}(y)$ Which one of the following serial schedules is conflict equivalent to $\textit{S}?$

(A)

$T_{1} \rightarrow T_{3} \rightarrow T_{4} \rightarrow T_{2}$

(B)

$T_{1} \rightarrow T_{4} \rightarrow T_{3} \rightarrow T_{2}$

(C)

$T_{4} \rightarrow T_{1} \rightarrow T_{3} \rightarrow T_{2}$

(D)

$T_{3} \rightarrow T_{1} \rightarrow T_{4} \rightarrow T_{2}$

Loading…