1.00

A continuation of the study of data structures begun in CS 210 with emphasis on the design and analysis of algorithms. Also, an introduction to questions of efficiency and NP completeness. Prerequisites: CS 210 and (CS 220 or MATH 250 ). Fall of odd years.