Chapter 1 — Programming basics, arrays, and vectors
Programming basics, arrays, and vectors
0 / 0 sections
CS 300 — Data Structures & Algorithms
LaTeX-sourced lecture notes + interactive practice.
Recently read
No recent activity yet.
Due for review
Nothing due — start reading or generate questions.
Required
6 graded chapters, ~25 hours of reading.
Chapter 2 — Algorithms, recursion, greedy, and DP
Algorithms, recursion, greedy, and DP
0 / 0 sections
Chapter 3 — Data structures, ADTs, Big-O, sorting
Data structures, ADTs, Big-O, sorting
0 / 0 sections
Chapter 4 — Lists, stacks, queues, deques
Lists, stacks, queues, deques
0 / 0 sections
Chapter 5 — Hash tables
Hash tables
0 / 0 sections
Chapter 6 — Trees and binary search trees
Trees and binary search trees
0 / 0 sections
Optional
Depth chapters; outside the graded path.
Chapter 7 — Heaps and priority queues
Heaps and priority queues
0 / 0 sections
Chapter 9 — AVL and red-black trees
AVL and red-black trees
0 / 0 sections
Chapter 10 — Graphs: BFS, DFS, shortest paths
Graphs: BFS, DFS, shortest paths
0 / 0 sections
Chapter 11 — B-trees and 2-3-4 trees
B-trees and 2-3-4 trees
0 / 0 sections
Chapter 12 — The set ADT
The set ADT
0 / 0 sections
Chapter 13 — Extra sorts and list idioms
Extra sorts and list idioms
0 / 0 sections