CSC 380 - Design and Analysis of Algorithms Credits: 3
Prerequisites: CSC 133 , CSC 231 with a grade of ‘C’ or better, MAT 161 . Algorithm design paradigms such as divide and conquer, greedy, and dynamic programming; techniques for algorithm analysis, such as asymptotic notations and estimates, as well as time/space trade-offs. Topics may include sorting, searching, scheduling, string matching, graph algorithms, amortized analysis, and computational geometry.
Click here for the Spring 2018 Class Schedule