CS 211 - Computer Science II

Units: 4

A continuation of program design and development. Introduction to data structures: stacks, queues, linear lists, trees, and sets. Includes pointers recursion, and implementation and analysis of sorting and searching algorithms. Extensive programming is required. Includes introduction to parallel models and algorithms, problem state space, relational database, and numerical approximation methods. Three hours of lecture. Three hours of laboratory.

Prerequisite(s): CS 111 and MATH 160 .