2017-18 Undergraduate and Graduate Catalogs

Search Results

MATH 209. Discrete Mathematics II. 3 Hours.

Intermediate discrete mathematics with an emphasis in computer science and applications including: combinatorics and probability, graph theory including circuits, isomorphisms, trees, shortest path algorithms, algorithm analysis, regular expressions and formal languages, and finite-state automata. Prerequisite: MATH 208 with a C or better.