Discrete Mathematics

Discrete mathematics supplies the language used to reason about programs and algorithms. The durable sequence is:

1. propositions, predicates, and proof techniques;
2. sets, functions, and relations;
3. induction and recursion;
4. counting and combinatorics;
5. graphs and trees;
6. discrete probability.

This is currently a seed map. Berkeley CS 70 is the external course path; concrete algorithm notes live in Computer Science.