Catalog Description: 

Counting methods for arrangements and selections, generating functions, recurrence relations, inclusionexclusion principle, elementary graph theory, trees and searching, network algorithms. 
Prerequisites: 

Required Course Materials: 

Course Coordinator: 

Course Audience: 

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 inclusionexclusion 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. 
Revised: August 2010