|
|
- Info
COMP 271: Data Structures: Algorithms and Applications
- Credit hours
- 3
- Prerequisites
- COMP 170
- Instructors
- Mr. Matt Bone, Dr. Konstantin Läufer, Dr. Chandra Sekharan
- 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. Läufer in Spring 2009
|
-
November
| Mo | Tu | We | Th | Fr | Sa | Su |
| | | | | | 1 |
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
| 30 | | | | | | |
|