MATH 4409 - Applied Combinatorics

Every other year. 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 assumes that students have taken MATH 3000. Students who have a grade of B- or better in MATH 3000 pass this course at a much higher rate. Cross-listed with MCKE 5409. Max hours: 3 Credits. Semester Hours: 3 to 3

Print-Friendly Page

[Add to Favorites]