CSCE A351 — Automata, Algorithms and Complexity 3 Credits
Study of the theory of computing and algorithm analysis and design. Topics include context-free grammars and parsing, finite automata and regular languages, pushdown automata and context-free grammars, deterministic and nondeterministic Turing machines, decidability and computability. In the algorithm domain, the course provides and introduction to analysis and complexity of algorithms, searching/sorting algorithms, mathematical algorithms, and graph theoretic algorithms. Introduction to complexity theory. Registration Restrictions: Admission to the Bachelor of Science in Computer Science or the Bachelor of Science in Computer Systems Engineering or the Bachelor of Science in Electrical Engineering or instructor approval