Skip to content

CSCI2100 · Knowledge-point graph

CSCI2100: Data Structures

143 knowledge points and 185 dependencies, each read from the notes' own definitions and proofs. A line runs from a prerequisite to what uses it.

Columns count steps of prerequisites only. They do not show difficulty or the order of the course; rows are chapters.

Chapter 1 · Disjoint sets

Chapter 2 · Linear data structures

Chapter 3 · Priority queues

Chapter 4 · Order statistics in search trees

Chapter 5 · Hashing

Chapter 6 · Probabilistic membership

Chapter 7 · String tries

Chapter 8 · Multiway search trees

Chapter 9 · Self-adjusting search trees

Chapter 10 · Linked-list invariants

Chapter 11 · Dynamic arrays

Chapter 12 · Searching sorted arrays

Chapter 13 · Graph traversal

Chapter 14 · Graph algorithms

Chapter 15 · Balanced search trees

Chapter 16 · Hash tables and universal hashing

Chapter 17 · Binary search trees

Chapter 18 · Sorting

Chapter 19 · Analysis of algorithms

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details