CSC
321:
Design and Analysis of Algorithms
Techniques for designing algorithms including: analyzing algorithms (big-O, recurrence relations) and divide-and-conquer (quicksort, mergesort). Additional topics chosen from: the greedy method, dynamic programming, backtracking, branch-and-bound and string matching.
CSC 301 and MAT140 are prerequisites for this class. MAT141 Recommended.