Suppose two schedules S1 and S2 of the same set of transactions and we know…

Suppose two schedules S1 and S2 of the same set of transactions and we know that S1 is conflict serializable, and the precedence graphs of the two schedules are the same, i.e. P(S1) = P(S2). 

Consider the following claims about S2: 

(i) S2 is serial schedule 

(ii) S2 is conflict serializable 

(iii) S2 is conflict equivalent to S1 

Which of the above is/are valid claims? 

  1. A.

    i and ii only 

  2. B.

    ii and iii only 

  3. C.

    ii only 

  4. D.

    iii only

Attempted by 149 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…