EXETER COURSE MAP

MAT40D

Topics in Discrete Math

Information

ELIGIBILITY

All students

PRE/CO-REQUISITES

MAT330 or equivalent

Description

The topics for this course depend on the interests of the instructor, and are usually drawn from everyday experience. They have included fair-division problems, such as apportioning the House of Representatives; network problems, such as map-coloring, scheduling, minimal-cost spanning trees, and the traveling salesman; various methods for extracting group preferences from election data; and quantifying the effect that coalitions have on voting power.

The topics for this course depend on the interests of the instructor, and are usually drawn from everyday experience. They have included fair-division problems, such as apportioning the House of Representatives; network problems, such as map-coloring, scheduling, minimal-cost spanning trees, and the traveling salesman; various methods for extracting group preferences from election data; and quantifying the effect that coalitions have on voting power.

Requirements

© Exeter Computing Club

GitHub