Mar 29, 2024  
2019-2020 Undergraduate Catalog 
    
2019-2020 Undergraduate Catalog [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 Spring 2022 Class Schedule