Introduction to analysis of finite collections and mathematical foundations of sequential machines, computer system design, data structures and algorithms. Includes a minimum of 6 of the following: sets, counting, recursion, graph theory, trees, nets, Boolean algebra, automata, and formal grammars and languages. Prerequisite: C or better in college algebra.
Description Revised Spring 2017 - 03/24/2017Credit hours revised 04/15/2016 - effective 01/01/2017