CSC 380 - Design and Analysis of Algorithms

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.

Credit Hours: 3

Prerequisite Courses: CSC 133 and CSC 231 with a minimum grade of C and MAT 161
Course Repeatability: Course may not be repeated. Maximum Repeatable Hours: 3

Click here for the Spring 2025 Class Schedule.