Nov2017 cs Q8

0. Suppose a database schedule S involves transactions T₁, T₂, .............,T_n. 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 ?

Answer
Comment
Array

Option : A
Explanation :
For a schedule, we can check its serializability by drawing a precedence graph and find its topological order, precedence graph of schedule must not contain any cycle to be conflict free. Refer:GATE-CS-2016 So, option (A) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.