MATH 310 - Combinatorial Problem Solving

Develops methods to solve combinatorial (finite) problems arising in mathematics, computer science, and other areas from the natural and social sciences. Enumeration and graph theory are the main subjects. Topics include recurrence relations, generating functions, inclusion-exclusion, modeling with graphs, trees and searching, graph coloring, and network algorithms. The emphasis is on problem solving rather than theory.

Credits: 1.00
When Offered: Fall semester only, in alternate years

Corequisite: None
Prerequisites: MATH 162 or MATH 112
Major/Minor Restrictions: None
Class Restriction: None
Area of Inquiry: Natural Sciences & Mathematics
Liberal Arts CORE: None

Click here for Course Offerings by term