AMS 301 — Finite Mathematical Structures
Combinatorics, graph theory, recurrence relations, generating functions, and discrete probability — the discrete-mathematics foundation for computer science and operations research.
Instructor: Prof. Tan H. Cao
Term: Spring
Location: SUNY Korea
🔗 Official course page (Stony Brook AMS): AMS 301 — Finite Mathematical Structures
Course overview
A first course in discrete mathematics. Develops counting techniques, graph-theoretic reasoning, and recursive thinking — the foundational tools for theoretical computer science and operations research.
Main topics
- Basic counting principles; permutations and combinations
- Inclusion–exclusion; pigeonhole principle
- Generating functions and recurrence relations
- Graphs and trees; Eulerian and Hamiltonian paths; matching
- Discrete probability and expectation
Prerequisites
AMS 151/161 (Applied Calculus) or equivalent.