\begin{frame}
  \frametitle{Example}

  \begin{quiz}{\textwidth}{Is the following schedule conflict-serializable?}
    \begin{tcenter}
      \begin{tikzpicture}
        \schedule{}{3}{1rV|2wV|1wV|3wV}
      \end{tikzpicture}
    \end{tcenter}
    \pause
    
    The precedence graph is:
    \begin{tcenter}
      \begin{tikzpicture}[node distance=20mm]
        \node (t1) {$T_1$}; 
        \node (t3) [below right of=t1] {$T_3$}; 
        \node (t2) [above right of=t3] {$T_2$}; 
        \mpause[1]{
          \draw [very thick,->] (t1) to[bend left=15] (t2);
          \draw [very thick,->] (t2) to[bend left=15] (t1);
          \draw [very thick,->] (t1) to (t3);
          \draw [very thick,->] (t2) to (t3);
        }
      \end{tikzpicture}
    \end{tcenter}
    \pause\pause
    
    There is a cycle, thus not conflict-serializable!
  \end{quiz}
  \pause\medskip
  
  However, the schedule is serializable: $T_1,T_2,T_3$!
  \smallskip

  The writes of $T_1$ and $T_2$ are \emph{blind writes}.
\end{frame}