CSC 321 - Analysis of Algorithms

Algorithm design strategies, including greedy, divide-and-conquer, and dynamic programming methods.  Advanced data structures, including balanced search trees, graphs, heaps, and priority queues.  Advanced methods of searching and sorting.  Computational complexity and analysis of algorithms.  NP-complete problems.

Satisfies a core requirement in the Computer Science major.
Satisfies an elective requirement in the Computer Science minor.
Counts towards the Mathematics major and minor.
 

Prerequisites & Notes

CSC 221 and one of CSC/MAT 220 or MAT 230, or permission of instructor.