Database Management Systems - Concurrency Control
GATE CSE & IT · 3 questions across 3 years (2017-2025) · 8% recurrence rate
Recurrence sparkline
2017–2025201720212025
Difficulty mix
med 100%
Question types
MCQ2
NAT1
All 3 questions on Database Management Systems - Concurrency Control
2025 Q53
Consider the database transactions T1 and T2, and data items X and Y. Which of the schedule(s) is/are conflict serializable? Transaction T1 R1(X) W1(Y) R1(X) W1(X) COMMIT(T1) Transaction T2 W2(X) W2(Y) COMMIT(T2)
Med✓
2024 Q46
Consider the following read-write schedule S over three transactions T1, T2, and T3, where the subscripts in the schedule indicate transaction IDs: S: r₁(z); w₁(z); r₂(x); r₃(y); w₃(y); r₂(y); w₂(x); w₂(y); Which of the...
Med✓
2017 Q44
Two transactions T₁ and T₂ are given as T1:r1(X)w1(X)r1(Y)w1(Y) T2:r2(Y)w2(Y)r2(Z)w2(Z) where ri (V) denotes a read operation by transaction Tᵢ on a variable V and wᵢ(V) denotes a write operation by transaction Tᵢ on a v...
Med✓