← Quiz: Consistency and Quorums: all 10 questions
Quiz: Consistency and Quorums · Question 1 of 10
With N = 3 replicas, which setting guarantees that every read overlaps the latest successful write?
With N = 3 replicas, which setting guarantees that every read overlaps the latest successful write?
- A.W = 1, R = 1
- B.W = 1, R = 2
- C.W = 2, R = 2
- D.W = 2, R = 1
Answer & explanation
Correct answer: W = 2, R = 2
2 + 2 = 4 > 3, so any 2 read replicas share at least one with any 2 written replicas.
Can you get the rest right without peeking?
Take the timed Quiz: Consistency and Quorums quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →