
Lecture 1 of 20 · Principles of Discrete Applied
Ankur Moitra, Peter Shor and Susan Ruff
Principles of Discrete Applied · 20 lectures
20 lectures
1: Pigeonhole Principle
2: Independence and Conditioning
3: Inclusion-Exclusion
4: Counting
5: More Counting and Generating Functions
6: More on Generating Functions
7: Generating Functions for Catalan Numbers
8: Tail Bounds
9: Chernoff Bounds
10: Modular Arithmetic
11: Basic Group Theory
12: Introduction to Linear Programming
13: Duality in Linear Programming
14: Zero-Sum Games
15: Max-Flow Min-Cut Theorem
16: Data Compression and Shannon’s Noiseless Coding Theorem
17: Huffman Coding
18: Transmitting Information Reliably over a Noisy Channel
19: Error-Correcting Codes—Hamming Codes
20: Reed-Solomon Codes