Consider the following schedule for transactions \(T1, T2\) and \(T3\):…
2010
Consider the following schedule for transactions \(T1, T2\) and \(T3\):
\(\begin{array}{|c|c|c|}\hline \textbf{T1} & \textbf{T2} & \textbf{T3} \\\hline \text{Read(X)} & \text{} & \text{} \\\hline \text{} & \text{Read(Y)} & \text{} \\\hline \text{} & \text{} & \text{Read(Y)} \\\hline \text{} & \text{Write(Y)} & \text{} \\\hline \text{Write(X)} & \text{} & \text{} \\\hline \text{} & \text{} & \text{Write(X)} \\\hline \text{} & \text{Read(X)} & \text{} \\\hline \text{} & \text{Write(X)} & \text{} \\\hline\end{array}\)
Which one of the schedules below is the correct serialization of the above?
- A.
\(T1 \to T3 \to T2\) - B.
\(T2 \to T1 \to T3\) - C.
\(T2 \to T3 \to T1\) - D.
\(T3 \to T1 \to T2\)
Attempted by 328 students.
A video solution is available for this question — log in and enroll to watch it.