Official curated learning paths
The rooms that go with the computing labs, in the order the labs run: circuits, then logic gates and a CPU, then programs, then version control. Play a warm-up before its lab, and the rest alongside it.
Froga
Big-O notation is how programmers describe how an algorithm's speed changes as the amount of data grows. This room covers the common complexity classes and what they mean for real programs, for anyone just starting to learn algorithms.
Froga
What actually happens between typing a web address and reaching a server: the chain of DNS servers involved, and how caching keeps it fast. For anyone curious about the plumbing behind every web visit.
Froga
How a scheduler picks which process gets the CPU, and what goes wrong when it picks badly. For anyone curious what actually happens between pressing a key and seeing it appear on screen.
Froga
A tour of how hash tables give near-constant-time lookup, insertion and deletion, and the collisions and load factor that decide whether that promise holds. Written for anyone who has used a dictionary or map in code and wants to know what is happening underneath.
Froga
The handful of ideas that make the Build a CPU lab make sense: what a truth table is, how counting works with nothing but on and off, and why adding two bits needs two digits. Ten minutes.
Froga