Relations and algebraic structures, counting techniques, graphs, automata and languages and number theoretical algorithms. This course emphasizes discrete mathematical algorithms, their applications to problems in computer science and their implementations.
Credit 4 hrs May not be repeated for additional credit Grade Mode Normal (A-F)
Prerequisite(s)COSC 211 and MATH 205 Class-Level Restriction Undergraduate standing
Updates Change to credit hour 2/2017, effective Fall 2017