CSC 301 - Analysis of Algorithms

4 credits (Fall and Spring)

Study methods for designing, analyzing, and implementing algorithms and data structures. The course explores formal and precise mechanisms for analyzing efficiency and verifying correctness and both iterative and recursive algorithms. Studies also cover a variety of fundamental algorithms, abstract data types, and data structures. Algorithm design strategies included greedy, divide-and-conquer, exhaustive search, and dynamic programming. Additional topics may include approximation, parallel, or randomized algorithms.

Prerequisite: CSC 207 and either MAT 218, CSC 208 or MAT 208; with grades S, C, or better.
Note: Plus-2 option available.
Instructor: Rebelsky, Eikmeier