CMP 761 Analysis of Algorithms

Techniques for the design and comparison of algorithms. Several models of computation will be considered. Topics chosen from: searching and sorting algorithms, algorithms on graphs, products involving polynomials and matrices, arithmetic complexity, fast Fourier transform, and NP-complete problems.

Credits:

4

Hours

4

Requirement Designation

Graduate Liberal Arts

Offered

Fall-Spring