Skills101
← All practice quizzes

Quiz: Concurrency Control

5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass

How a database runs many transactions at once and still gets correct results. Schedules, conflicting operations, precedence graphs, recoverable schedules, two-phase locking, deadlock prevention and timestamp ordering.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    Which pair of operations conflicts?

  2. Question 2

    When is a schedule conflict serializable?

  3. Question 3

    In schedule R1(A), R2(A), W1(A), W2(A), which edges does the precedence graph have?

  4. Question 4

    A precedence graph has edges T2 → T1 and T1 → T3, and no others. Which serial order is equivalent?

  5. Question 5

    T2 reads a value written by T1, and T2 commits before T1 commits. The schedule is:

🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?Take today’s challenge →