CS 22
Data Structures & Parallelism
CS 22 is a demanding course that covers implementation, correctness, and analysis of data structures and some parallel algorithms. This course is intended for students who have already taken a data structures course at the level of CS 2. Topics include implementation and analysis of skip lists, trees, hashing, and heaps as well as various algorithms (including string matching, parallel sorting, parallel prefix). The course includes weekly written and programming assignments covering the lecture material. Not offered 2026-27.
Topics
- implementation and analysis of skip lists
- trees
- hashing
- and heaps as well as various algorithms (including string matching
- parallel sorting
- parallel prefix)
Topics explicitly listed in official catalogue description
Prerequisites & course information
Prerequisites: CS 2 or instructor's permission.
Sources
- Course catalogue ↗2026-2027