 | Select the desired Level or 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 Restrictions: May not be assigned one of the following Student Attributes: Online Accelerated Programs Prerequisites: Undergraduate level CSC 133 Minimum Grade of D- and Undergraduate level CSC 231 Minimum Grade of C and Undergraduate level MAT 161 Minimum Grade of D- |
| Return to Previous | New Search |
 |