GATE CS 2021 (Afternoon) — Question 42

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

Let \(S\) be the following schedule of operations of three transactions \(T_1\), \(T_2\) and \(T_3\) in a relational database system: \(R_2(Y), R_1(X), R_3(Z), R_1(Y), W_1(X), R_2(Z), W_2(Y), R_3(X), W_3(Z)\) Consider the statements \(P\) and \(Q\) below: \(P\) : \(S\) is conflict-serializable. \(Q\) : If \(T_3\) commits before \(T_1\) finishes, then \(S\) is recoverable. Which one of the following choices is correct?
  1. A
    Both \(P\) and \(Q\) are true.
  2. B
    \(P\) is true and \(Q\) is false.
  3. C
    \(P\) is false and \(Q\) is true.
  4. D
    Both \(P\) and \(Q\) are false.
Practise the full 2021-AN 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