Read Review Gaps

Required

ch_1 — Programming basics, arrays, and vectors
ch_2 — Algorithms, recursion, greedy, and DP
ch_3 — Data structures, ADTs, Big-O, sorting
ch_4 — Lists, stacks, queues, deques
ch_5 — Hash tables
ch_6 — Trees and binary search trees

Optional

ch_7 — Heaps and priority queues
ch_9 — AVL and red-black trees
ch_10 — Graphs: BFS, DFS, shortest paths
ch_11 — B-trees and 2-3-4 trees
ch_12 — The set ADT
ch_13 — Extra sorts and list idioms

Chapter 12 · Questions

The set ADT

Lectures
Notes
Practice
Questions

Questions are generated locally. Run cs-300 on your machine to generate and review questions for this chapter.

Filter: |

Loading questions…

Count

Types mc short llm_graded code

⏳ Generating…

≡ Outline · Notes · Transcript ▲

Gaps

No gaps recorded yet.

interactive mode active