Follow Us :

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 ?
S1: r1(X); r2(X); w1(X); r3(X); w2(X)
S2: r2(X); r1(X); w2(X); r3(X); w1(X)
S3: r3(X); r2(X); r1(X); w2(X); w1(X)
S4: r2.(X); w2(X); r3(X); r1(X); w1(X)

  • Option : D
  • Explanation :
    We can draw precedence graph for each schedule and for conflict serializability graph must not contain cycle.
    Nov2017 cs
    So, option (D) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *