System Design Core Checkpoint

1. Denormalization is usually used to:

Optimize read latency Prevent duplicates Enforce ACID Reduce write load

2. LSM trees are typically better for:

Write-heavy workloads Read-only workloads In-memory caches Graph traversal

3. Cache invalidation is hard because:

You must coordinate freshness across data sources Caches are slow Memory is infinite Keys are random

4. At-least-once delivery requires consumers to be ____.

5. A good shard key should:

Distribute load evenly Use sequential integers only Always be user email Change every request

6. Full-text search is commonly built on:

Inverted index Binary heap BFS Bloom filter only

7. Linearizable consistency guarantees that operations appear to execute ____.