CSC 321 - Design and Analysis of Algorithms (3 cr.)

Course presents general techniques for the design of algorithms. These include divide-and-conquer, dynamic programming, greedy algorithms, and randomized algorithms. Specific algorithms are studied which are drawn from a variety of applications - bioinformatics, scheduling, encryption, graphics, search space. Advanced data structures - graphs, balanced trees - will be studied with applicable algorithms.
Liberal arts
Prerequisite(s): CSC 223 (grade of C or better).
Semester(s) Offered: Fall