Discrete Mathematics for Computer Science

Lecture Topic	Click to Download PPT
Pancakes with a problem	Lecture 1
Deterministic Finite Automata	Lecture 2
Solving problems and writing proofs	Lecture 3
Inductive Reasoning	Lecture 4
Ancient Wisdom: Unary and Binary	Lecture 5
Counting I: Correspondences and Choice Trees	Lecture 6
Counting II: Recurring Problems and Correspondences	Lecture 7
Counting III	Lecture 8
The Mathematics of 1950's Dating	Lecture 9
Probability Theory: Counting in Terms of Proportions	Lecture 10
Probability Theory: Great Expectations	Lecture 11
Random Walks	Lecture 12
Ancient Wisdom: On Raising A Number to a Power	Lecture 13
Euclid's Algorithm and Continued Fractions	Lecture 14
Fibonacci Numbers, Polynomial Coefficients, Vector Programs	Lecture 15
Randomness and Computation	Lecture 16
Modular Arithmetic and the RSA Cryptosystem	Lecture 17
Group Theory	Lecture 18
Graphs	Lecture 19
Graphs II	Lecture20
The Big Oh	Lecture21
Grade School Revisited: How to Multiply Two Numbers	Lecture22,   Lecture22b
Cantor's Legacy: Infinity and Diagonalization	Lecture23
Turing's Legacy: The Limits of Computation	Lecture24
Godel's Legacy: What is a Proof?	Lecture25
Complexity Theory: Reductions Between Computational Problems	Lecture26
Complexity Theory: The P vs. NP Question	Lecture27