2009 Fall MATH 124-01
Bulletin Course Description Permutations and combinations, generating functions, recurrence relations; topics in enumeration theory, including the Principle of Inclusion-Exclusion and Polya Theory; topics in graph theory, including trees, circuits, and matrix representations; applications. Instructor: Staff
(Instructor named in bulletin description above may not be current. For current instructor, see listing below.)
Title COMBINATORICS Department MATH Course Number 2009 Fall 124 Section Number 01 Primary Instructor Trangenstein,John Prerequisites Prerequisite: Mathematics 32, 32L, 41 or consent of instructor. Course Homepage www.math.duke.edu/~johnt/math124.html
Synopsis of course content
Combinatorics is (mostly) concerned with finite structures. This makes the subject easily accessible. Most of the questions can be explained within five minutes without much theoretical background. Combinatorial techniques are applied to such problems as experimental design, binary codes, network flows and scheduling.
Textbooks
Roberts, Applied Combinatorics, 2nd edition
Assignments
There will be weekly homework assignments.
Exams
Two midterms and a final exam.
Grade to be based on
The components of the course are weighted as follows:
Homework: 20
Midterm I: 25
Midterm II: 25
Final: 30
Additional Information
This class can serve as a preparation BEFORE the computer science algorithm classes
