Provides an introduction to combinatorics and combinatorial algorithms, withapplications to areas such as computer science and probability. Topics include general counting methods, recurrence relations, generating functions, inclusion-exclusion, partial orders, and graph theory. Prerequisite: grade of C or better in Math 2250. (Offered spring semester) 1/27/2020 - 5/8/2020, Lecture