Nov 18, 2019  
University Undergraduate Catalog 2018-2019 
    
University Undergraduate Catalog 2018-2019 [ARCHIVED CATALOG]

COMP 2300 - Discrete Structures for Computation (3)


Prerequisites: C or better in either MATH 2010  or COMP 2200 . An introduction to combination enumeration (including the inclusion-exclusion principle, multinomial coefficients, recurrence relations, and generating functions), graph theory (including graph coloring, graph matching, tours and networks), and basic string recognition methods (including finite state machines, pushdown automata, and Turing machines).


Click here for the Fall 2019 Class Schedule