CSCI3501 — Algorithms and Computability
Models of computation (such as Turing machines, deterministic and non-deterministic machines); approaches to the design of algorithms, determining correctness and efficiency of algorithms; complexity classes, NP-completeness, approximation algorithms. (4 hrs lect, 2 hrs lab) prereq: CSci 1302 or both Math 2202 and Math 3411, CSci 2101