GATE CS 2026 Set 2 Q10 — Transactions and Concurrency Control

In database management systems, two operations in a schedule are said to conflict if and only if they satisfy all of the following three conditions:

1. They belong to different transactions.
2. They access the same data item (in this case, $A$).
3. At least one of the operations is a write operation.

Let's analyze the conflict status for different combinations of operations on data item $A$ by transactions $T_1$ and $T_2$:

• Read-Read (RR): Both $T_1$ and $T_2$ only read $A$. Since neither operation is a write, they do not conflict.
• Read-Write (RW) or Write-Read (WR): One transaction reads $A$ and the other writes $A$. Since one operation is a write, they conflict.
• Write-Write (WW): Both transactions write $A$. Since at least one (in this case, both) is a write operation, they conflict.

Therefore, for $T_1$ and $T_2$ to not conflict on $A$, both transactions must only read $A$.

Hence, Option A is the correct statement.