Section numbers come from Discrete Mathematics with Applications by Susanna Epp.

1. Introduction to Probability; Possibility Trees and the Multiplication Rule, Secs. 9.1-9.2
2. Counting Elements of Disjoint Sets: The Addition Rule; The Pigeonhole Principle, Secs. 9.3-9.4
3. Counting Subsets of a Set: Combinations; r-Combinations with Repetition Allowed, Secs. 9.5-9.6
4. Pascal’s Formula and the Binomial Theorem, Sec. 9.7
5. Probability Axioms and Expected Value, Sec. 9.8
6. Conditional Probability, Bayes’ Formula, and Independent Events, Sec. 9.9
7. Trails, Paths, and Circuits, Sec. 10.1
8. Matrix Representations of Graphs, Sec. 10.2
9. Isomorphisms of Graphs, Sec. 10.3
10. Trees: Examples and Basic Properties; Rooted Trees, Secs. 10.4-10.5
11. Spanning Trees and a Shortest Path Algorithm, Sec. 10.6
12. Formal Languages and Regular Expressions, Sec. 12.1
13. Finite-State Automata, Sec. 12.2
14. Simplifying Finite-State Automata, Sec. 12.3
15. Context-free Grammars (supplemental textbook material)