Algorithm Analysis

Catalog description

This course teaches abstract techniques for analyzing and designing algorithms. Tools include cost models, run-time analysis, dynamic programming, and the study of upper and lower bounds. The goals are to understand and assess classical algorithms on various data structure (including graphs), as well as to sharpen problem solving skills and development of new algorithms. Lecture Hours: 3 Repeatability: May not be repeated for credit. Grade Mode: Normal, Audit Program Restrictions: 1MS-MCOS-MS-Computer Science Schedule Type (Primary): Lecture Click here for the Schedule of Classes.