COMP 229 Data Structures
We begin with topics found in advanced programming. In particular, topics from object-oriented programming and how this differs from procedural programming. We then move on to the study of dynamic data structures, such as linked lists, stacks, queues, trees, heaps, graphs, hash tables, sets and more. Completion of this course opens up the remainder of the Computer Science classes and is required for minors. Common themes that run throughout this course are: (1) implementation of the abstract data types, and (2) spatial and memory consideration and analysis.
Prerequisite
COMP 127,
COMP 131,
COMP 211, a score of 4 or 5 on the AP Computer Science A examination, or permission of instructor.