CS 322 - Formal Methods

4.00 credits.

Topics include those associated with discrete mathematics as they apply to computing sciences, including induction and recursion in algorithms, graph theory in paths, trees, and local area networks. A discussion of grammar classifications, finite-state machines, and push-down automata emphasizing context-free grammars and their use in parsing programming languages. *Prerequisite(s): CS 122 and MA 121. Spring semester, even-numbered years.