GATE CS 2022 (Forenoon) — Question 39

Database Management Systems (DBMS)Transactions, Concurrency Control, Conflict SerializabilityMCQ2 marks · −2/3 if wrongMedium

Let \(R_i(z)\) and \(W_i(z)\) denote read and write operations on a data element \(z\) by a transaction \(T_i\), respectively. Consider the schedule \(S\) with four transactions.
\[ S : R_4(x), R_2(x), R_3(x), R_1(y), W_1(y), W_2(x), W_3(y), R_4(y) \]
Which one of the following serial schedules is conflict equivalent to \(S\)?
  1. A
    \(T_1 \to T_3 \to T_4 \to T_2\)
  2. B
    \(T_1 \to T_4 \to T_3 \to T_2\)
  3. C
    \(T_4 \to T_1 \to T_3 \to T_2\)
  4. D
    \(T_3 \to T_1 \to T_4 \to T_2\)
Practise the full 2022-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
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