Question 1

What is the CAP theorem and how does it drive consistency vs availability tradeoffs?

Accepted Answer

# CAP Theorem: Consistency vs. Availability Tradeoffs (Beginner-Friendly Guide)

**Target Audience:** Junior & Senior Software Engineers preparing for System Design Interviews — no prior system design knowledge assumed.
**Difficulty:** Easy to Medium

> **How to read this doc:** Every concept is explained in plain language first. Right after, you'll see a callout like `📌 Interview term:` — that's the exact vocabulary a senior engineer would use for the same idea.

## 1. Why This Even Matters —

Question 2

What is database replication?

Accepted Answer

**Target Audience:** Beginners to distributed data — you know what a database server is; no prior knowledge of replication assumed.
**Difficulty:** Medium
**Verified with:** Node 22.22 and Python 3.12 (both print identical output).

> **How to read this doc:** Every idea is explained in plain language first, then tagged with `📌 Interview term:` so you also learn the exact words an interviewer expects. Behaviour shown comes from running the example; the **Verified** section quotes the full outpu

Question 3

What is the difference between strong and eventual consistency?

Accepted Answer

**Target Audience:** Beginners to distributed systems — you know what a database and a replica copy are; everything else is defined as we go.
**Difficulty:** Medium
**Verified with:** Node 22.22 and Python 3.12 (both print identical output).

> **How to read this doc:** Every idea is explained in plain language first, then tagged with `📌 Interview term:` so you also learn the exact words an interviewer expects. Stale-read rates and timings come from the example program; the **Verified** section

Question 4

What is a read/write quorum?

Accepted Answer

**Target Audience:** Beginners to distributed systems who know that databases can keep copies of data on several machines.
**Difficulty:** Medium
**Verified with:** Node 22.22, Python 3.12, Go 1.24 and Java 21 (all four print identical output). Cassandra consistency levels are cited from the DataStax Cassandra documentation; Dynamo techniques from the Dynamo paper (SOSP 2007) as summarised in course material.

> **How to read this doc:** Every idea is explained in plain language first, then tagg

Question 5

How would you design a distributed key-value store?

Accepted Answer

**Target Audience:** Engineers preparing for the classic "design a key-value store" round, which tests whether you can combine partitioning, replication, consistency and storage into one coherent system.
**Difficulty:** Hard
**Verified with:** Node 22.22, Python 3.12, Go 1.24 and Java 21 for the cluster example (identical output); Node 22.22 and Python 3.12 for the storage-engine example. The design follows the Dynamo paper (DeCandia et al., SOSP 2007); the DynamoDB 400 KB item limit is from the

SYSTEM DESIGNDECODED.

Medium

What is the CAP theorem and how does it drive consistency vs availability tradeoffs?

What is database replication?

What is the difference between strong and eventual consistency?

What is a read/write quorum?

Hard

How would you design a distributed key-value store?