← All topics
Quiz: Concurrency Control: questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. Which pair of operations conflicts?
- Q2. When is a schedule conflict serializable?
- Q3. In schedule R1(A), R2(A), W1(A), W2(A), which edges does the precedence graph have?
- Q4. A precedence graph has edges T2 → T1 and T1 → T3, and no others. Which serial order is equivalent?
- Q5. T2 reads a value written by T1, and T2 commits before T1 commits. The schedule is:
- Q6. What does the two-phase locking protocol guarantee?
- Q7. In strict 2PL, which locks are held until the transaction commits or aborts?
- Q8. Wait-die scheme: a YOUNGER transaction asks for a lock held by an OLDER one. What happens?
- Q9. Timestamp ordering: TS(T5) = 5 wants to write X, but readTS(X) = 8. What happens?
- Q10. Why do MVCC databases let long reports run without blocking updates?