Classic computer architecture experiment: Iterate over 100,000 integers and conditionally sum elements > 128. If the array is unsorted, the CPU's branch predictor misses 50% of the time, stalling the instruction pipeline. If the array is sorted, branch prediction accuracy is ~99%, and execution runs 6x faster. Understanding hardware mechanics makes you a dramatically better programmer.

CTFs are divided into 5 standard categories: Web, Crypto, Forensics, Rev (Reverse Engineering), and Pwn (Binary Exploitation). Start with PicoCTF: solve the 50-point web challenges (inspecting page source, modifying cookies, basic SQL injections), then learn Ghidra for reverse engineering simple binaries. The dopamine of finding your first flag is unmatched.

When you type `campusloop.space`: 1. Browser checks local cache 2. Queries Recursive Resolver (ISP or 1.1.1.1) 3. Resolver asks Root Nameserver -> TLD Nameserver (.space) -> Authoritative Nameserver 4. Authoritative nameserver returns the IP address A-record. All within 15 milliseconds across global fiber cables.

You can't see the base of the mountain (global minimum). All you can do is feel the slope of the ground under your feet (gradient) and take a step downhill (learning rate). If your step is too big, you overshoot the valley. If it's too small, you take 10 years to reach the bottom. Keep your analogies visual when learning AI!

Judges don't care about your 1,500 lines of code; they care about 3 things: 1. The Problem Hook (first 30 seconds: relatable student or real-world pain point) 2. Live Working Demo (never use slide screenshots; show real clicks) 3. Business / Scalability model (how does this survive beyond Sunday morning?). Keep slides under 6 pages.