CS 260 - Computer Science 3: Data Structures

Lecture Hours: 4
Credit Hours: 4

Covers general-purpose data structures and algorithms, their complexity analysis, software engineering of these structures, and the application of these engineering concepts to real world problems. Includes managing complexity, complexity analysis, stacks, queues, lists, trees, heaps, hash tables, sets, maps, and graphs.

Prerequisite: Placement into WR 115 (or higher), or completion of WR 090 (or higher); and completion of CS 162 ; or consent of instructor. (All prerequisite courses must be completed with a grade of C or better.)