CS 6003Analysis of Algorithms

Catalog

This course introduces methods for the design and analysis of efficient algorithms emphasizing methods useful in practice. Different algorithms for a given computational task are presented and their relative merits are evaluated based on performance measures. The following computational problens are discussed: sorting, searching, elements of dynamic programming and greedy algorithms, advances data structures, graph algorithms (shortest path, spanning tress, tree traversals), string matching, elements of computational geometry, and NP-completeness.