In this course students will study topics that 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, and optimality.
Prerequisites
CM 220 Computer Science II Data Structures with C++. Must pass prerequisite with a C (2.0) or better.