COMPUTER SCIENCE MCQS: Suppose a database schedule S involves transactions T1, T2, .............,Tn. Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. [N17P3Q8]