Founded in 1966

CS 2150: Design and Analysis of Algorithms

Description

This course deals with the analysis of algorithms and the relevance of such analysis to the design of efficient algorithms. The derivation of results that are primarily of theoretical significance shares importance with the practical task of designing efficient algorithms. Topics covered: searching and sorting, graph algorithms, arithmetic, NP-completeness, and lower bound techniques.

Suggested Course

CS 1510 or its equivalent.

You are using an older browser that does not support current Web standards. Although this site is viewable in all browsers, it will look much better in a browser that supports Web standards.