CS 3610

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. Three lecture hours per week