COS 585 - Design and Analysis of Computing Algorithms

Techniques for designing algorithms, such as divide-and-conquer, greedy method, dynamic programming, and backtracking are emphasized and illustrated. Many problems of practical importance are covered, including minimum spanning tree, single source shortest path, traveling salesperson, and graph search. The concepts of NP-completeness are also considered.

Prerequisite(s): Graduate Standing or appropriate Accelerated Graduate Pathway.
Co-requisite(s):
Credits: 3

Course Typically Offered: Spring
Course Type: Computer Science