Check yourself

Multiple-choice questions on algorithm analysis and design, following Levitin's Chapters 1–12: a core set organized by topic plus practice and original questions. Every answer explains why it is right and why the other options are wrong — read the explanation even when you get it right.

Acronyms you'll meet: Depth-First Search (DFS), Breadth-First Search (BFS), Directed Acyclic Graph (DAG), Traveling Salesman Problem (TSP), Minimum Spanning Tree (MST), Binary Search Tree (BST), Binary Reflected Gray Code (BRGC), Adelson-Velsky–Landis tree (AVL), Dynamic Programming (DP), deterministic Polynomial time (P), Nondeterministic Polynomial time (NP).