CS221 Data Structures

    credits: 3


Analyses design and implementation of algorithms of the manipulation of data structures. Topics include single and multiple linked lists, stacks, queues, multi-dimensioned and sparse arrays, binary and general trees, AVL height balancing, graphs, networks, and shortest path and minimum spanning tree algorithms. Students complete several programming assignments. Prerequisite: CS132. Co requisite: MA171. Offered fall.