GATE CS 2024 (Forenoon) — Question 46

Database Management Systems (DBMS)Transactions, Concurrency Control, Conflict SerializabilityMSQ2 marksMedium

Consider the following read-write schedule \( S \) over three transactions \( T_1 \), \( T_2 \) and \( T_3 \), where the subscripts in the schedule indicate transaction IDs:
\[ S : r_1(z); \; w_1(z); \; r_2(x); \; r_3(y); \; w_3(y); \; r_2(y); \; w_2(x); \; w_2(y); \]
Which of the following transaction schedules is/are conflict equivalent to \( S \)?
  1. A
    \( T_1 \; T_2 \; T_3 \)
  2. B
    \( T_1 \; T_3 \; T_2 \)
  3. C
    \( T_3 \; T_2 \; T_1 \)
  4. D
    \( T_3 \; T_1 \; T_2 \)
Practise the full 2024-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkDatabase System Concepts (Korth)Normalisation, SQL, transactions and indexing — the DBMS syllabus in one book.
Practise more on Transactions, Concurrency Control, Conflict SerializabilityTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group