CSCI-6210

Design and Analysis of Algorithms

Theoretical and empirical analysis of algorithms; tools for on-line monitoring of the algorithm’s performance. Advanced algorithms for polynomial problems; randomized heuristic and approximate algorithms. Problems include computation in discrete mathematics, number theory, linear algebra, graph theory, numerical and symbolic computing. Prerequisite: CSCI-4020 or equivalent. Fall term annually.

3 credit hours