|
May 14, 2024
|
|
|
|
2007-2008 [ARCHIVED CATALOG]
|
MAT 221 - Discrete Methods Instructor
Staff
An introduction to the basic techniques of problem solving in discrete mathematics. Topics include counting methods for arrangements and selections, generating functions, recurrence relations and inclusion-exclusion, covering circuits, graph coloring, trees and searching, and network algorithms.
Prerequisites & Notes Prerequisite: Mathematics 135 or 150 or permission of the instructor. (Fall)
|
|