CS 440 Algorithms
The course studies standard methods and examples in the design and analysis of algorithms. Topics include some basic paradigms in algorithm design and analysis of the efficiency and optimality of representative algorithms selected from some of graph, pattern matching, numerical, randomized and approximation algorithms.
Prerequisite
CS 234 and MATH 141.
Offered
Spring semester as needed