Networking & Protocols
Putting it together: free-recall review
Retrieval beats re-reading. Each prompt spans several lessons at once — say or write a complete answer from memory before you open the model answer. The effort of reconstructing the connection across chapters is what makes the whole system stick.
Reconstruct the track as one system: the fixed phase chain, why eliminating round-trips beats shortening them, how the browser turns the last bytes into pixels, how a trace localises a slow hop, and how the resilience stack stops one failure from taking down all twelve layers.
- 01Walk one HTTPS request from keystroke to first paint and name which actor owns each phase. Why must the first four phases run in sequence?
- 02Explain why eliminating round-trips beats shortening them, and list the levers that eliminate one or more.
- 03The network finishes fast but LCP is poor. Walk the critical render path and name the four highest-impact fixes.
- 04p95 latency tripled overnight. How does distributed tracing localise the slow hop, and which sampling strategy guarantees you have a trace?
- 05Describe how a single slow dependency becomes a site-wide outage, and the layered defenses that stop it.
- 06Why does QUIC survive a WiFi-to-cellular handoff while TCP+HTTP/2 breaks, and what deployment constraint makes it actually work?
If you could reconstruct each answer from memory, you hold the track’s spine: the request is a fixed phase chain owned by distinct actors, round-trip count is the latency lever and eliminating round-trips beats shortening them, the render pipeline decides LCP once the bytes land, distributed tracing localises a slow hop in seconds, the resilience stack stops one slow dependency from cascading, and QUIC’s connection ID lets a connection outlive an IP change — provided the load balancer routes by it.