Topics studied include: Analysis tools-Turing and Markov algorithms, complexity measures, computational techniques; bound analysis of algorithms. Algorithms for internal and external searching/sorting. Network stack analysis. Optimality.
Prerequisites
CM 220 Computer Science II Data Structures with C++. Must pass prerequisite with a C (2.0) or better.