Course Schedule
Lecture 1: Pigeonhole Principle (Ankur Moitra)
Lecture 2: Independence and Conditioning (Ankur Moitra)
Homework 1 due
Lecture 3: Inclusion-Exclusion (Ankur Moitra)
Lecture 4: Counting (Peter Shor)
Homework 2 due
Lecture 5: More Counting and Generating Functions (Peter Shor)
Lecture 6: More on Generating Functions (Peter Shor)
Homework 3 due
Lecture 7: Generating Functions for Catalan Numbers (Peter Shor)
In-class Quiz 1
Lecture 8: Tail Bounds (Ankur Moitra)
Homework 4 due
Lecture 9: Chernoff Bounds (Ankur Moitra)
Lecture 10: Modular Arithmetic (Ankur Moitra)
Homework 5 due
Lecture 11: Basic Group Theory (Ankur Moitra)
First draft of term paper due
Lecture 12: Introduction to Linear Programming (Peter Shor)
Homework 6 due
Lecture 13: Duality in Linear Programming (Peter Shor)
Lecture 14: Zero-Sum Games (Ankur Moitra)
Homework 7 due
In-class Quiz 2
Lecture 15: Max-Flow Min-Cut Theorem (Peter Shor)
Lecture 16: Data Compression and Shannon’s Noiseless Coding Theorem (Ankur Moitra)
Homework 8 due
Second draft of term paper due
Lecture 17: Huffman Coding (Ankur Moitra)
Lecture 18: Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem (Ankur Moitra)
Homework 9 due
Lecture 19: Error-Correcting Codes—Hamming Codes (Peter Shor)
Lecture 20: Reed-Solomon Codes (Peter Shor)
In-class Quiz 3
Final draft of term paper due
