COMP 271: Data Structures
Mr. Matt Bone, Dr. Konstantin Läufer, Dr. Chandra Sekharan
This continuation of COMP 170 introduces the concepts of data abstraction and data structure, including stacks, queues, lists, sets, and trees. The issues of implementing a data structure in a language such as Java are examined using classes, arrays, and linked structures. Sorting and searching techniques are analyzed. The concepts of correctness and efficiency of algorithms are developed. Time/space comparisons of iterative algorithms with recursive algorithms are made. The course includes several major programming projects. A weekly lab component is required.
Taught by Dr. Läufer in Spring 2009