Nov2017 cs Q7

0. Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item X, denoted by r(X) and w(X) respectively. Which one of them is conflict serializable ?
S₁: r₁(X); r₂(X); w₁(X); r₃(X); w₂(X)
S₂: r₂(X); r₁(X); w₂(X); r₃(X); w₁(X)
S₃: r₃(X); r₂(X); r₁(X); w₂(X); w₁(X)
S₄: r₂.(X); w₂(X); r₃(X); r₁(X); w₁(X)

Answer
Comment
Array

Option : D
Explanation :
We can draw precedence graph for each schedule and for conflict serializability graph must not contain cycle.

So, option (D) 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.