CMU 15-213: Introduction to Computer Systems
15-213 is the famous CS:APP course: data representation, x86-64 assembly, caches, memory, linking, exceptions, virtual memory, and concurrency, taught through the legendary lab sequence (bomb lab, attack lab, cache lab, malloc lab, shell lab, proxy lab). Its textbook and materials are used worldwide, making it one of the most-searched CS courses on the internet.
Fennie is independent and not affiliated with Carnegie Mellon University. This is an unofficial study guide.
What makes it hard
The labs are beloved and brutal: each one is a multi-week project where progress is nonlinear, hours of nothing followed by breakthrough. Malloc lab in particular is a rite of passage that punishes late starts unrecoverably. Exams compound the difficulty by testing deep mental models (cache behavior, stack discipline, virtual memory translation) that can't be crammed from slides.
What you'll cover
- • Integer and floating-point representation
- • x86-64 assembly and the stack
- • Caches and memory hierarchy
- • Linking, exceptions, and processes
- • Virtual memory
- • Dynamic memory allocation
- • Concurrency basics
The 15-213 study guide
How to study for CMU 15-213, step by step.
- 1
Start every lab the day it releases
213 lab progress is nonlinear, hours of stuck and then breakthrough, so calendar time is the resource that matters. The students underwater at every deadline are the ones who started a week late, every time.
- 2
Read the relevant CS:APP chapter before its lab
The labs assume the textbook's mental models, and reverse-engineering them from the lab itself is the slow path. An evening with the chapter saves days in the lab.
- 3
Build the machine model, not slide memories
Exams test whether you can simulate the machine: trace assembly, compute cache hits, walk an address translation. For each unit, practice running the model by hand on small examples until it's mechanical.
- 4
Treat malloc lab as a three-week project
It's the course's summit and it eats every hour you give it. Get a correct naive version working early, then iterate on utilization and throughput. Correctness first, performance second, heroics never.
- 5
Self-learners: do the labs, on a schedule
The CS:APP book plus the public labs are the worldwide systems curriculum, but reading without labbing produces trivia, not understanding. Set fixed deadlines per lab and honor them like tuition depended on it.
Today
Today's 15-213 plan
What a Fennie Daily Plan looks like for 15-213. Yours is built from your own syllabus and adapts every day to your deadlines and progress.
First plan free, no card required. Fennie is independent and unaffiliated with your school.
FAQ
Is 15-213 hard?
It's one of CMU's defining courses: conceptually deep, with labs that are multi-week projects where progress comes in breakthroughs. Students who start labs on release day and build real mental models do well, and almost universally call it the most valuable course they took.
Can I self-study 15-213 online?
Effectively yes: the CS:APP textbook, lecture materials, and lab handouts are publicly available and used by self-learners worldwide. The labs are where the course lives. Reading the book without doing them gets you vocabulary, not the systems intuition employers can detect.
What is malloc lab and why is it famous?
It's the course's summit: implementing a dynamic memory allocator graded on correctness, space utilization, and throughput. It integrates everything (pointers, alignment, performance reasoning) and its appetite for time is legendary. Start absurdly early; that advice is the whole secret.
More CMU courses
15-112: Fundamentals of Programming and Computer Science
15-112 is CMU's famous accelerated introduction to programming in Python: control flow, functions, data structures, recursion, OOP, and efficiency, ending in an open-ended term project. Its public course website and the related CMU CS Academy platform give it a search footprint far beyond Pittsburgh.
15-110: Principles of Computing
15-110 is CMU's gentler introduction to computing, covering Python programming plus computing concepts like data representation, algorithms, and the limits of computation. It's designed for students who aren't CS majors or who want a runway before 15-112, and it's one of the largest courses on campus.
15-122: Principles of Imperative Computation
15-122 teaches imperative programming with correctness front and center: contracts, loop invariants, and reasoning about code in the C0 teaching language before transitioning to real C. It covers data structures from stacks and queues through hash tables, trees, and graphs, and it's the second course of the CMU CS core.
15-150: Principles of Functional Programming
15-150 teaches functional programming in Standard ML: types, recursion and induction, higher-order functions, and reasoning about programs as mathematical objects. It runs alongside 15-122 in the CMU CS core, and for most students it's the first time programming and proof become the same activity.