MAT 320 - Combinatorics
The mathematics of arrangements of discrete sets, including binomial and multinomial coefficients, inclusion and exclusion, the pigeonhole principle, partitions and compositions, Stirling and Catalan numbers, occupancy problems, generating functions, recurrence relations, and selected modern topics.
Counts as an elective in the Theory category of the Computer Science major.
Prerequisites & Notes
CSC/MAT 220, MAT 230, or MAT 255
Add to Portfolio (opens a new window)