| Catalog Description: |
|---|
|
Counting methods for arrangements and selections, generating functions, recurrence relations, inclusion-exclusion principle, elementary graph theory, trees and searching, network algorithms. Prerequisite: MATH 112. (Offered even years, fall semester.) |
| Required Course Materials: |
|
Alan Tucker, Applied Combinatorics, 4th edition, John Wiley & Sons Inc., 2001. |
| Course Coordinator: |
|
P. Christopher Staecker, Ph.D., Assistant Professor of Mathematics |
| Course Audience: |
|
Math and computer science majors. |
| Course Objectives: |
|
| Topics: |
|
Introductory graph theory, Euler circuits, Hamiltonian paths, graph coloring, planarity, graph isomorphism, shortest paths, networks, and applications of graphs. The combinatorics topics include generating polynomials, exponential generating functions, solving diophantine equations, the inclusion-exclusion principle, derangements, mathematical induction, recursion and elementary counting problems including partitions of integers, the analysis of elementary games and puzzles using graph analysis will also be a topic of discussion. Comparison of several sorting algorithms will be discussed. |
| Resources: |
|
Revised: August 2006