AnyLearn
All lessons

Computer Science lessons & courses

10 lessons · 1 learning path · free, quiz-checked, no signup required

The foundations beneath the stack: how computers represent data, schedule work, and move bits. Timeless material that outlives any particular framework.

Learning paths

All Computer Science lessons

Computer Science
intermediate

Idempotency

Why "the same request twice should produce the same result" is one of the most useful properties you can give an API, the standard patterns for implementing it (keys, dedupe tables, natural idempotency), and what goes wrong when you don't.

8 steps·~12 min·audio
Computer Science
intermediate

Event-Driven Architecture

Commands tell, events announce. How event-driven systems decouple producers from consumers, when CQRS and event sourcing earn their complexity, and the eventual-consistency tax you pay either way.

8 steps·~12 min·audio
Computer Science
intermediate

Microservices vs Monoliths

The honest case for each. When a monolith is correct, what microservices actually buy you (and what they cost), Conway's law, and how to spot a fake microservices architecture that's actually a distributed monolith.

8 steps·~12 min·audio
Computer Science
beginner

CDNs Explained

Why your assets should never come from your origin. How a CDN's edge cache, geographic routing, and invalidation actually work, plus the cases where a CDN doesn't help (or quietly hurts).

8 steps·~12 min·audio
Computer Science
intermediate

Rate Limiting

How to keep one client from breaking the system for everyone else. The four canonical algorithms (fixed window, sliding window, token bucket, leaky bucket), distributed limiting with Redis, and the polite way to tell a client "slow down".

8 steps·~12 min·audio
Computer Science
intermediate

Message Queues

Async work between services without one tripping the other. Point-to-point vs pub/sub, the three delivery guarantees and what they cost, dead letter queues, and how to pick between Kafka, RabbitMQ, SQS, and friends.

8 steps·~12 min·audio
Computer Science
intermediate

Caching Strategies

The named caching patterns (cache-aside, read-through, write-through, write-behind), when each makes sense, and the failure modes that bite even experienced teams (thundering herd, stale invalidation, the second-hardest problem).

8 steps·~12 min·audio
Computer Science
intermediate

The CAP Theorem

Why every distributed system has to give up something when the network splits. CAP, the trade-offs in real databases, and the PACELC extension that's usually more useful in practice.

8 steps·~12 min·audio
Computer Science
intermediate

Database Sharding

When one database isn't enough. How sharding splits data across nodes, the trade-offs of different sharding keys, and the operational headaches (hot spots, rebalancing, cross-shard queries) you sign up for.

8 steps·~12 min·audio
Computer Science
intermediate

Load Balancing

How load balancers spread traffic across servers, what L4 and L7 actually mean, the routing algorithms in real use, and the failure modes you need to design around.

8 steps·~12 min·audio