Apr 20, 2024  
2008-2009 
    
2008-2009 [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
Mathematics 135 or 150 or permission of the instructor. (Fall)