2019-2020 Undergraduate Catalogue Archived Catalogue
|
MAT 375 - Combinatorics Techniques for counting configurations of objects. Recurrence relations; principle of inclusion-exclusion; graphs, trees, and circuits. Additional topics chosen from Polya’s Theorem, generating functions, and network flows.
Credit Hours: 3
Prerequisite Courses: MAT 275 or CSC 133 Course Repeatablility: Course may not be repeated. Maximum Repeatable Hours: 3
Click here for the Spring 2025 Class Schedule.
|