GATEverse Practice, past papers & mock tests
GATE 2024 · CS1 - Forenoon
Database ManagementTransactions and Concurrency ControlhardMSQ2 marks
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?

Select every correct option.

Save your progress

Related Database Management PYQs