CSC 551 Design and Analysis of Algorithms (4015) (3 credits)

Concepts of program complexity; basic approaches to complexity reduction: data structures and techniques; worst cases and expected complexity. Topics to be covered may include sorting, set manipulation, graph algorithms, matrix multiplication, and finite Fourier transforms, polynomial arithmetic, and pattern matching.

Prerequisite: CSC 550 Object Oriented Design and Data Structures.