The GATE Grind

GATE 2007 CS – Question 64

Databases · Transactions and Concurrency Control · 2 marks · Multiple choice

Which is TRUE about these schedules?

S1: r1(X);r1(Y);r2(X);r2(Y);w2(Y);w1(X)

S2: r1(X);r2(X);r2(Y);w2(Y);r1(Y);w1(X)

  1. Both conflict-serializable.
  2. S1 serializable, S2 not.
  3. S1 not serializable, S2 serializable.
  4. Neither serializable.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) S1 not serializable, S2 serializable.

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Transactions and Concurrency Control questions

All Transactions and Concurrency Control questions →