A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?
a. Topological order
b. Depth - first order
c. Breadth - first order
d. Ascending order of transaction indices
Answer:Topological order
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: