Skills101
← All practice quizzes

Quiz: Consistency and Quorums

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

When data lives on several replicas, a read can return old data. Learn the consistency models from strong to eventual, prove the R + W > N quorum rule in Python, and choose the right level for each feature.

Log in to take the quiz

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

  1. Question 1

    With N = 3 replicas, which setting guarantees that every read overlaps the latest successful write?

  2. Question 2

    What does this print?

    from itertools import combinations
    n, w, r = 4, 2, 2
    ok = all(set(a) & set(b) for a in combinations(range(n), w) for b in combinations(range(n), r))
    print(ok, w + r > n)
    
  3. Question 3

    Asha edits her bio and the page reloads showing the old bio. Which consistency guarantee was missing?

  4. Question 4

    Which feature can safely use eventual consistency?

  5. Question 5

    What does read repair do?

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