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 , CS 270 , MATH 111 , MATH 250 . (Group II)