Mathematics 310 - Combinatorial Problem Solving

Institution:

Colgate University

Subject:

Description:

A. Robertson, T. Tucker This course 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. Prerequisite: MATH 112. Offered in the spring only, in alternate years.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.colgate.edu

Phone Number:

(315) 228-1000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.