Analysis of Algorithms

Prerequisite: COMP 250 with a minimum grade of "C-"; and MATH 161/161E This course is a general overview of algorithms, including algorithmic techniques needed in problem solving, and relative efficiency of algorithms. Topics will include efficient algorithms for data manipulation, graphical analysis, rapid evaluation of algebraic functions and matrix operations, and NlogN bound in sorting algorithms. Offered fall semester. May be taken for graduate-level credit.