 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| 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.
3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Computer Science Department |
 |