Data Struct & Algorithms
Prerequisite: CS 112 and MATH 235 or MATH 201 with a minimum grade of C
Algorithm analysis and asymptotic running time calculations. Algorithm design techniques and implementation details. Algorithms for sorting and searching, trees, graphs, and other selected topics. Four hours lecture. Offered every Spring.