Academic Catalog 2016–2017

jump to navigation

Courses

CSC611 Design and Analysis of Algorithms

[3–0, 3 cr.]

This course addresses both the fundamentals and the research boundaries of algorithm design and analysis. Covered topics include: complexity of algorithms, divide and conquer techniques, greedy methods, dynamic programming, recursive backtracking, amortized analysis, graph algorithms, polynomial-time problem reduction, NP-completeness, approximation algorithms and a selected advanced topic.