ANALYSIS AND DESIGN OF ALGORITHMS

Undergraduate

This course, which introduces the study of algorithm design and measures of efficiency, is a continuation of CS 2920 Topics include algorithm complexity and analysis; techniques such as divide and conquer, greedy and dynamic programming; searching and sorting algorithms; graph algorithms; text processing; efficient algorithms for several common computer science problems and NP-completeness. PREREQUISITE: CS 2910, CS 2920 and MATH 2420 Three lecture hours per week