 | Select the desired Level or Schedule Type to find available classes for the course. |
| CSC 532 - Design and Analysis of Algorithms I |
|
Prerequisite: CSC 331 or (MIS 316 and CSC 231) or CSC 500 or equivalent. 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 Restrictions: Must be enrolled in one of the following Levels: Graduate Prerequisites: Undergraduate level CSC 331 Minimum Grade of B or (Undergraduate level MIS 316 Minimum Grade of B and Undergraduate level CSC 231 Minimum Grade of B) or Graduate level CSC 500 Minimum Grade of B |
| Return to Previous | New Search |
 |