CS 212 - Data Structures and Algorithms

FA. A systematic study of algorithms and their application to data structures, including arrays, lists, trees, heaps, hash tables and graphs. Algorithms and data structures are analyzed in their use of both time and space, and the choice of data structure in problem solving is studied. Theoretical issues, such as optimality, best and worst-case performance and limitations of algorithms are studied, as well as implementation issues. Prerequisite: CS 112. MATH 251, which may be taken concurrently, is recommended.

Print-Friendly Page (opens a new window)