The whole of computer science, running.
Courses take the names a computer science degree uses and the textbooks those courses are built from, so whether you are taking the module, catching up on it, or filling a gap you never covered, what you learn here maps onto the material everyone else is using.
Available now
2 courses- Available now
Algorithms
Algorithms
Recursion, the cost of a loop, and the two walls of the degree: searching, sorting and dynamic programming, each one running so you can take it apart.
- Recursion
- Big-O
- Binary search
- Sorting
- Graph traversal
- +3 more
Open course →9 of 9 lessons readyCLRS - In progress
Data Structures
Data Structures
How data is actually arranged in memory, and what each arrangement costs you, from a single pointer to a balanced tree, shown as the machine sees it.
- Memory & pointers
- Arrays
- Linked lists
- Stacks & queues
- Trees
- +3 more
Open course →2 of 9 lessons readyCLRS
Coming next
in curriculum orderBuilt in this order deliberately: each course reuses the visual machinery of the one before it, which is what makes the next one arrive faster than the last.
- Coming next
OS
Operating Systems
Deadlock as a graph you can watch lock up, paging as an address being quietly rewritten, and scheduling as a timeline you control.
- Deadlock
- Paging & TLB
- Semaphores
- Scheduling
- Context switch
0 of 10 lessons readySilberschatz · Tanenbaum - Coming next
Architecture
Computer Organisation & Architecture
Pipelines stalling on a hazard, a cache deciding where a line goes, and what a float actually looks like in memory.
- Pipelining & hazards
- Cache mapping
- Two's complement
- IEEE 754
0 of 10 lessons readyPatterson & Hennessy - Coming next
DBMS
Database Management Systems
Normalisation shown as data moving, B+ tree indexes splitting under insertion, and transactions interleaving until something goes wrong.
- Normalisation
- B+ tree indexes
- Transactions
- Joins
0 of 8 lessons readySilberschatz & Korth - Coming next
Networks
Computer Networks
The handshake as a conversation, the sliding window actually sliding, and congestion control reacting to a link you can throttle yourself.
- TCP handshake
- Sliding window
- Congestion control
- Subnetting
0 of 8 lessons readyKurose & Ross - Coming next
Theory
Theory of Computation & Compilers
Automata you can feed a string to one character at a time, and a parser building the tree in front of you.
- DFA & NFA
- Pumping lemma
- Parsing
- Abstract syntax trees
0 of 8 lessons readySipser · Aho et al.
Start with the one everybody gets stuck on
Recursion is the first wall in most degrees. It is also the lesson where seeing the call tree and the call stack at the same time does the most work.
Open the recursion lesson