Design and Analysis of Algorithms: 3 semester hours

Catalog description

Introduction to algorithm design and analysis, computational complexity, and NP-completeness theory. The course emphasizes how to design and choose appropriate algorithms and data structures to solve a given problem efficiently. Design methods covered include divide-and-conquer techniques, greedy methods, and dynamic programming. Problem domains covered include string matching, polynomials and matrices, graph theory, optimal trees, and NP-hard problems. Prerequisites: COMP 3305 or COMP 3053.