AMS 301 — Finite Mathematical Structures
Combinatorics, graph theory, recurrence relations, and discrete probability — discrete-mathematics foundations for CS and operations research.
Instructor: Prof. Tan H. Cao
Term: Fall
Location: SUNY Korea
🔗 Official course page (Stony Brook AMS): AMS 301 — Finite Mathematical Structures
Course overview
A first course in discrete mathematics, covering the counting and graph-theoretic tools needed for theoretical CS and OR.
Main topics
- Counting principles; permutations and combinations
- Inclusion–exclusion; pigeonhole
- Generating functions; recurrence relations
- Graphs and trees; paths and matchings
- Discrete probability and expectation
Prerequisites
AMS 151/161 (Applied Calculus) or equivalent.