Theory of Computation

Catalog description

A study of the major theoretical topics needed for a well-rounded knowledge of computer science. These will include automata, formal languages, asymptotic, NP-completeness, formal verification and the design of algorithms. Prerequisite(s): CSCI 3030 >= C and CSCI 3400 >= C Lecture Hours: 3 Repeatability: May not be repeated for credit. Grade Mode: Normal, Audit Schedule Type (Primary): Lecture Schedule Type (Additional): Asynchronous Instruction Click here for the Schedule of Classes.