GATE CS 2017 Set 2 — Question 44

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
NAT+2 / -0HardConflict SerializabilityTransactions & ConcurrencyDatabases

Databases → Transactions & Concurrency → Conflict Serializability

Last updated

Question

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 operation by transaction TiT_i on a variable VV and wi(V)w_i(V) denotes a 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 ________.
Your answer

Enter a number. Decimals, negative values and scientific notation are accepted.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Transactions & Concurrency