Enumerative combinatorics is concerned with counting the number of elements of finite sets with prescribed conditions. The techniques covered include inclusion-exclusion, bijective proofs, double-counting arguments, recurrence relations, and generating functions. (Offered jointly with MATH-402.) Three term hours; lectures.