Major emphasis is on applied combinatorics and combinatorial algorithms, with applications in computer science and operations. Topics include general counting methods, generating functions, recurrence relations, inclusion-exclusion, and block designs. Note: This course is not applicable toward any degree in the College of Liberal Arts and Sciences. Prereq: MATH 3000. Cross-listed with MATH 4409. Semester Hours: 3 to 3
