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 500
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 Fall 2024 Class Schedule.