Catalogue 2015 - 2016

CS 366 Design and Analysis of Algorithms

Credits

3 cr.

Prerequisite

CS 200/IT 200, CS 210 or permission of instructor.

Course Description

This course provides students with the fundamental techniques and strategies used in the design of algorithms, including proper selection of data structures, dynamic programming, divide-and-conquer, greedy methods, and backtracking. The course also exposes students to the analysis of algorithms using methods to estimate run-time performance. The theory of NP-completeness is discussed, along with heuristic methods for constructing algorithms for "hard problems." Numerous case studies give students perspective into how algorithm problems arise in the real world.

Distribution

MR

Offered

in alternate spring semesters.

Fee