GATE CS 2021 (Forenoon) — Question 42

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 respectively on a data item \(z\) by a transaction \(T_i\). Consider the following two schedules: \(S_1 : r_1(x), r_1(y), r_2(x), r_2(y), w_2(y), w_1(x)\) \(S_2 : r_1(x), r_2(x), r_2(y), w_2(y), r_1(y), w_1(x)\) Which one of the following options is correct?
  1. A
    \(S_1\) is conflict serializable, and \(S_2\) is not conflict serializable.
  2. B
    \(S_1\) is not conflict serializable, and \(S_2\) is conflict serializable.
  3. C
    Both \(S_1\) and \(S_2\) are conflict serializable.
  4. D
    Neither \(S_1\) nor \(S_2\) is conflict serializable.
Practise the full 2021-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