CSC 533 - Design and Analysis of Algorithms II

Credits: 3

Prerequisite: CSC 532. Theory of the design of efficient computer algorithms. Amortized analysis, sorting networks, matrix operations. Polynomials and FFT, number-theoretic algorithms, and computational geometry.

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