main navigation
my pace

CS 608 Algorithms and Computing Theory

Course Description: Applications of abstraction and divide-and-conquer in computer science (hardware, software, theory); essentials algorithms including searching, sorting, hashing and graphs; popular algorithms such as string machine, Map Reduce and RSA and their applications; complexity; computability; NP-hard problems, NP-complete problems, and undecided problems; finite state automata vs. regular expressions.

Course Rotation: NY:WP;Fall

Credits

3 credits

Prerequisite

CS 502 Minimum Grade of C