CS 271: Data Structures
Course Description
This course introduces advanced object-oriented design techniques and covers fundamental concepts, implementation, and analysis of data structures essential for algorithm design. Topics include abstract classes, interfaces, generics, and various data structures such as linked lists, stacks, queues, trees, heaps, hash tables, and graphs. Analysis covers asymptotic analysis and empirical performance measurements. Prerequisites: Grade of C or better in COMP SCI 171 or 262 and MATH 108 or equivalent. Special course fees may apply.