Problem solving that deals with finite sets. Permutations and combinations, generating functions, recurrence relations, Polya's theory of counting, fundamentals of graph theory, difference equations and enumeration techniques. Prerequisite: MA 237N or CS 150M.
- Teacher: Keith Copenhaver
Category: Spring Semester 2025





