main navigation
my pace

CS 242 Algorithms and Computing Theory

Prerequisite: A grade of "C" or better in CS 241, MAT 137, and MAT 131.

Course Description: Applications of abstraction and divide-and-conquer I computer science (hardware, software, theory); essential algorithms including searching, sorting, hashing and graphs, popular algorithms such as branch-and-bound, RSA and their applications; computing complexity and computability, NP-hard problems, NP-complete problems, and undecidable problems; and finite state automata vs. regular expressions.

Course Rotation: NYC: Fall and Spring. PLV: Spring.


4 credits


CS 241 Minimum Grade of D