GateQA is a free GATE CS preparation platform featuring 3,500+ previous-year questions (1987–2026),
36,000+ aptitude questions, subject-wise and year-wise mock tests, performance analytics,
and full offline support. Practice Operating Systems, Algorithms, DBMS, Computer Networks,
Theory of Computation, Discrete Mathematics, Compiler Design, Digital Logic, and more.
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),…
Answer: B
This static SEO snapshot loads the full interactive GateQA app when JavaScript is available.