CSC 560. Analysis of Algorithms. 3 Credits.

This course introduces the methods to analyze the efficiency of computer algorithms in terms of their use of both space and time. Algorithmic design techniques, such as divide and conquer, greedy methods, and dynamic programming are illustrated throughout the course. The theory of NP-completeness and tractibility is introduced.
Pre / Co requisites: CSC 560 requires prerequisite of CSC 520.
Typically offered in Spring.