GATE CS 2017 (Afternoon) — Question 44

Database Management Systems (DBMS)Transactions, Concurrency Control, Conflict SerializabilityNAT2 marksHard

Two transactions \(T_1\) and \(T_2\) are given as \(T_1: r_1(X) \ w_1(X) \ r_1(Y) \ w_1(Y)\) \(T_2: r_2(Y) \ w_2(Y) \ r_2(Z) \ w_2(Z)\) where \(r_i(V)\) denotes a read operation by transaction \(T_i\) on a variable V and \(w_i(V)\) denotes a write operation by transaction \(T_i\) on a variable V. The total number of conflict serializable schedules that can be formed by \(T_1\) and \(T_2\) is ________.
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
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