Multiple choice

Consider the following schedule for transactions T1, T2 and T3:

$\underline {T1}$ $\underline{T2}$ $\underline{T1}$ Read(X) Read(Y) Read(Y) Write(Y) Write(X) Write(X) Read(X) Write(X)

Which one of the schedules below is the correct serialization of the above?

  1. T1 $\rightarrow$ T3 $\rightarrow$ T2
  2. T2 $\rightarrow$ T1 $\rightarrow$ T3
  3. T2 $\rightarrow$ T3 $\rightarrow$ T1
  4. T3 $\rightarrow$ T1 $\rightarrow$ T2
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Drawing the dependency graph where an edge between two transactions exits if there is read write or write-write conflict between them

Keep practicing — related questions