CS 332CD Algorithms

Surveys fundamental algorithms, including efficient search and sort algorithms, graph algorithms and dynamic programming. Discusses basic methods for the design and analysis of efficient algorithms. Students will understand the purpose and best use of alternatives from the rich canon of computational algorithms. Includes a weekly laboratory. 4 credits.

Credits

4

Prerequisite

Completed CS 232CD, and MATH 210CD