CS 240
Data Structures and Data Management
Fall 2026
Topics
- Time and space complexity
- Priority queues
- Sorting
- Dictionaries
- Text processing
- Data-structure design and analysis
Readings
- Algorithm Design and Applications2015
- Algorithms in C++1998
- Computational Geometry: Algorithms and Applications
- Introduction to Algorithms2001
- CS 240: Data Structures and Data Management — course notes by Therese Biedl and other instructors.
2013
Topics
- Introduction and review
- Stacks, queues, and priority queues
- Sorting and analysis of randomized algorithms
- Search trees
- Hashing
- Range search and multidimensional dictionaries
- Algorithms and data structures for text processing
Readings
- Algorithms in C
Sources
- Course catalogue ↗2026–2027
- course_website ↗Fall 2026
- departmental_course_outline ↗2013
- Listed books are optional references; course notes are the primary material.
- Departmental typical outline and references; assignments and textbooks may vary by term. Source revision: (December 11, 2013). Year refers to the departmental revision date, not a specific offering.