 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| CSC 532 - Design and Analysis of Algorithms I |
|
Theory of the design of efficient computer algorithms. Algorithms for sorting, searching, pattern matching, and polynomial arithmetic, cryptography, as well as study of greedy algorithms, graph algorithms.
3.000 Credit hours 3.000 Lecture hours Levels: Graduate Schedule Types: Lecture Computer Science Department |
 |