GATE Computer Science (CS) 2016 Shift 2 Solved Paper

Suppose a database schedule S involves transactions T1, …,T_n. Construct the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?