System Internals
Review β†—Glossary β†—All systems β†—

Learning path

A guided route from the basics to senior system-design fluency. Each step is a real simulator you operate β€” work top to bottom, or jump anywhere.

0 of 30 complete
Start learning β†’ Client ↔ Server
9494 recall cards dueSpaced review keeps it in memory β€” predict/quiz cards + cross-topic decision drills
1

Absolute basics

How the web works before any database or cluster.

The request/response loop behind everything online.

Turn a hostname into an IP before any request is sent.

TCP vs UDPBeginner

Reliable ordered stream vs fire-and-forget datagrams.

HTTP & APIsBeginner

Request/response, status codes, caching, REST vs RPC vs GraphQL.

Interleaving on one core vs real overlap on many; speedup and Amdahl's law.

The NumbersBeginner

Latency hierarchy, throughput, Little's Law, and nines β†’ downtime.

2

Data structures that scale

The structures the rest of the stack is built on.

Prefix tree behind typeahead; O(prefix) lookups.

Skip ListIntermediate

Sorted set via coin-flip express lanes; no rebalancing.

B+ TreeIntermediate

How a database finds any row β€” or any range β€” in just a few disk reads.

3

Storage engines

How databases actually persist and find data on disk.

Bloom FilterBeginner

Probabilistic membership: 'definitely not / maybe'.

BitcaskIntermediate

A key-value store that finds any value in a single disk read.

LSM TreeAdvanced

How write-heavy databases keep up: buffer writes in memory, flush to disk in batches.

4

Caching

Make reads fast β€” and keep the cache honest.

The data structures behind cache eviction.

Caching StrategiesIntermediate

cache-aside, write-through/back/around, TTL, stampede.

5

One machine under load

Concurrency and traffic control on a single node.

Event LoopIntermediate

Single-threaded concurrency behind Redis & Node.

Token/leaky bucket and window counters.

Circuit BreakerIntermediate

Fail fast and recover when a dependency degrades.

6

Partitioning & locating data

Spread data across machines and find it again.

Consistent HashingIntermediate

The ring that moves minimal data when nodes change.

Kademlia DHTAdvanced

XOR distance + k-buckets; O(log n) lookups, no coordinator.

QuadtreeIntermediate

Spatial index for 'find things near me'.

Round-robin, least-conn, weighted, power-of-two-choices.

7

Time, replication & consistency

Keep copies in sync when clocks and networks lie.

Why clocks drift and how NTP-style sync corrects them.

Gossip ProtocolIntermediate

Epidemic dissemination / anti-entropy with no coordinator.

Merkle TreeIntermediate

Find which replicas diverged in O(log n) comparisons.

Tunable consistency: R + W > N, read-repair.

Leader election + replicated log behind etcd/Consul.

8

Transactions & coordination

Make many services agree β€” or undo together.

Two-Phase CommitIntermediate

Atomic commit across services β€” and its blocking flaw.

Saga PatternIntermediate

Multi-service transactions via compensating rollback.

9

Messaging & streaming

Decouple producers from consumers with a durable log.

Partitioned log: consumer groups, offsets, rebalancing.

10

Probabilistic toolkit

Trade a little accuracy for a lot of memory.

HyperLogLogIntermediate

Count millions of distinct items in a few KB.