Machine & Systems Foundations
Computer Systems: A Programmer's Perspective (CS:APP, 3rd Edition)
Randal E. Bryant & David R. O'Hallaron
The single best bridge between high-level programming and how hardware and operating systems actually execute code. It demystifies assembly, memory hierarchy, linking, virtual memory, and network I/O.
Priority focus: Chapters 1–3 (Data & Machine-Level Representation), Chapter 6 (Memory Hierarchy), Chapter 7 (Linking), and Chapter 9 (Virtual Memory).
Operating Systems & Concurrency
Operating Systems: Three Easy Pieces (OSTEP)
Remzi H. Arpaci-Dusseau & Andrea C. Arpaci-Dusseau
A crystal-clear, mechanism-first breakdown of virtualization (CPU and memory), concurrency (locks, condition variables, semaphores), and persistence (disks, file systems, crash recovery).
Priority focus: Virtualization (Processes, Address Spaces, Paging), Concurrency (Locks, Condition Variables, Concurrency Bugs), and Persistence (I/O Devices, File Systems, Journaling).
Open free online edition ↗Databases & Distributed Systems
Designing Data-Intensive Applications (DDIA)
Martin Kleppmann
Connects storage engine internals (B-trees, LSM-trees, WAL) and transaction isolation levels to replication, partitioning, consensus, and real-world distributed data systems.
Priority focus: Chapters 1–3 (Data Models & Storage Engines), Chapter 5 (Replication), Chapter 7 (Transactions), and Chapters 8–9 (Distributed System Faults & Consensus).
Software Architecture & Craft
A Philosophy of Software Design
John Ousterhout
Provides a sharp, actionable vocabulary for fighting software complexity: deep vs. shallow modules, information leakage, defining errors out of existence, and writing design documentation that matters.
Priority focus: Read cover-to-cover (it is concise) and apply its module-depth checklist when refactoring your own projects.
Discrete Mathematics & Proofs
Mathematics for Computer Science (MIT 6.042J)
Eric Lehman, F. Thomson Leighton & Albert R. Meyer
Supplies the discrete mathematics every software engineer needs: proof by induction, state invariants, graph theory, recurrences, asymptotic notation, and discrete probability.
Priority focus: Part I (Proofs, Induction, State Machines), Part II (Structures, Graphs, Relations), and Part IV (Counting & Asymptotics).
Open free online edition ↗Programming Abstractions & Mental Models
Structure and Interpretation of Computer Programs (SICP)
Harold Abelson & Gerald Jay Sussman
Teaches how to control complexity in large programs through procedural abstraction, higher-order functions, data-directed programming, mutable state modeling, and building interpreters.
Priority focus: Chapters 1–3 (Procedures, Data Abstraction, Modularity, Objects, and State) and Chapter 4 (Metalinguistic Abstraction).
Open free online edition ↗Continuous Mathematics
Calculus (4th Edition) / Early Transcendentals
Michael Spivak (rigorous theory) or James Stewart (applied fluency)
Develops quantitative maturity with limits, rates of change, accumulation, and series approximations—essential for performance modeling, graphics, simulation, and machine learning.
Priority focus: Limits and Continuity, Differentiation and Optimization, Definite Integrals and the Fundamental Theorem, and Taylor Polynomials.
Developer Tooling & Workflows
The Missing Semester of Your CS Education
Anish Athalye, Jon Gjengset & Jose Javier Gonzalez Ortiz (MIT CSAIL)
Covers the command-line shell, data wrangling, Git internals, debugging, profiling, and build systems that traditional curricula assume you pick up by osmosis.
Priority focus: Shell Tools and Scripting, Command-Line Environment, Version Control (Git), Debugging and Profiling.
Open free online edition ↗