comp 271 :data structures: algorithms and applications
- Credit hours
- 3
- Prerequisites
- COMP 170
- Description
- 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.
- Syllabus
- Taught by Dr. Sekharan.