Quiz
Quorum Consistency in Replicated Systems
Understanding why R + W > N guarantees strong consistency in quorum-based replicated data stores.
A partitioned key-value store replicates each shard across N=5 nodes and uses quorum reads/writes with W=3 write acknowledgments. Under normal operation (no membership changes), what is the smallest read quorum R that guarantees a read always observes the most recently acknowledged write, and why?