CSC 532 - Design and Analysis of Algorithms I

Course Description: 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.

Credit Hours: 3

Corequisite Courses: None
Prerequisite Courses: CSC 331 (min grade B) or ( MIS 316 (min grade B) and CSC 231 (min grade B) ) or CSC 500 (min grade B)
Additional Restrictions/ Requirements: Prerequiste coures or equivalent
Course Repeatability Course may not be repeated

ADDITIONAL COURSE INFORMATION

Equivalent Courses: None
Undergraduate Crosslisting: None
Additional Course Fees: None
Course Attribute: None

Click here for the Spring 2025 Class Schedule.