Analysis of Algorithms

3 credits

Design and analysis of algorithms, illustrated from various problem areas. Models of computation, choice of data structures, space and time efficiency, computation complexity, algorithms for searching, sorting and graph-theoretic problems, NP-complete problems. [3-0-0] Prerequisite: All of COSC 221, COSC 222 and one of MATH 221, APSC 179.