Skip to content
Official PYQ · 2017

GATE CS 2017 Set 2 Q44 — Transactions and Concurrency Control

Explain with AI
Two transactions T1T_1 and T2T_2 are given as

T1:r1(X)w1(X)r1(Y)w1(Y)T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)

T2:r2(Y)w2(Y)r2(Z)w2(Z)T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)

where ri(V)r_i(V) denotes a read\textit{read} operation by transaction TiT_i on a variable VV and wi(V)w_i(V) denotes a write\textit{write} operation by transaction TiT_i on a variable VV. The total number of conflict serializable schedules that can be formed by T1T_1 and T2T_2 is ______
View answer

Answer: 54

Worked explanation not available yet.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Transactions and Concurrency Control questions