CS221 Data Structures & Algorithms
Physics and Engineering 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. This course will also introduce the analysis of the run-time behavior of algorithms and how design considerations affect algorithm performance. Topics include the analysis of greedy algorithms, divide and conquer techniques, and dynamic programming. Students complete several programming assignments. Prerequisite: CS132. Co requisite: MA171. Offered fall.