StreakPeaked· Practice

ExamsGATETechnical

Consider the following read-write schedule S over three transactions T1, T2, and T3, where the subscripts in the schedule indicate transaction IDs: S: r1(z); w1(z); r2(x); r3(y); w3(y); r2(y); w2(x); w2(y); Which of the following transaction schedules is/are conflict equivalent to S ?

  1. T1 T2 T3
  2. T1 T3 T2
  3. T3 T2 T1
  4. T3 T1 T2

Correct answer: T1 T3 T2

Solution

The correct option T1 T3 T2 maintains the order of conflicting operations from the original schedule S, ensuring that the read and write operations on the same data items occur in the same sequence, thus preserving the consistency of the transactions.

Related GATE Technical questions

⚔️ Practice GATE Technical free + battle 1v1 →