CS 2150 DESIGN & ANALYSIS OF ALGORITHMS
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.
- Credits: Variable
- Frequency: Every term
- CS 1510 DESIGN AND ANALYSIS OF ALGORITHMS (CS 2012)
- Or its equivalent
Requirements and Grading
To view the sections for a term, click on it's name below.
|24221||MWF||1:00 pm - 2:15 pm||SENSQ 5313||