This section contains the course notes, Mathematics for Computer Science. Chapter 8 is not available on MIT OpenCourseWare.
These notes are courtesy of Eric Lehman, Tom Leighton, and Albert Meyer, and are used with permission.
CHAPTERS | FILES |
---|---|
Complete course notes | (![]() |
Part I: Proofs | |
Chapter 1: Propositions | (![]() |
Chapter 2: Patterns of proof | (![]() |
Chapter 3: Induction | (![]() |
Chapter 4: Number theory | (![]() |
Part II: Structures | |
Chapter 5: Graph theory | (![]() |
Chapter 6: Directed graphs | (![]() |
Chapter 7: Relations and partial orders | (![]() |
Chapter 8: State machines | |
Part III: Counting | |
Chapter 9: Sums and asymptotics | (![]() |
Chapter 10: Recurrences | (![]() |
Chapter 11: Cardinality rules | (![]() |
Chapter 12: Generating functions | (![]() |
Chapter 13: Infinite sets | (![]() |
Part IV: Probability | |
Chapter 14: Events and probability spaces | (![]() |
Chapter 15: Conditional probability | (![]() |
Chapter 16: Independence | (![]() |
Chapter 17: Random variables and distributions | (![]() |
Chapter 18: Expectation | (![]() |
Chapter 19: Deviations | (![]() |
Chapter 20: Random walks | (![]() |