CSC 532 - Design and Analysis of Algorithms I

Credits: 3

Prerequisite: CSC 331 or (MIS 316 and CSC 231) 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.

Repeat Policy:
Course may only be taken once for credit

Click here for the class schedule. select Browse Course Catalog or Register for Classes.