CS 472 Analysis of Algorithms

(Lab fee) This course is an introduction to the classic methods for designing algorithms. The course will study specific problems such as sorting, graph traversals, and matrix multiplication in order to illustrate these methods. The methods studied will include: Divide and Conquer, Back-Tracking, Branch and Bound, and Dynamic Programming and a brief introduction to computational complexity.

Credits

3

Prerequisite

MA 308 and CS 372