Introduction to data structures
Choose how to organize data by comparing the work of adding, finding, and removing it.
Take quiz
Test your knowledge
You read the tutorial. Now explain the why, spot the tradeoffs, and put the concepts to work.
Pick from 45 quizzes covering the technical tutorials and labs in our data structures and algorithms series. Each has 24 multiple-choice questions, from a gentle warm-up to scenarios that make you think. You get an explanation after every answer, including the ones you get right. There is no timer, no sign-up wall, and no penalty for coming back to try again.
Choose how to organize data by comparing the work of adding, finding, and removing it.
Take quizPredict how work and memory grow, then choose an approach that fits the job.
Take quizTrace array operations, explain their costs, and pick the right collection for a real workload.
Take quizFollow the pointers, catch hidden traversal costs, and choose the right kind of list.
Take quizTrace LIFO operations, inspect the JavaScript wrapper, and reason about undo, copying, and storage costs.
Take quizPredict FIFO behavior, follow linked-list queue operations, and compare ordering and performance tradeoffs.
Take quizRead parent-child relationships, calculate height and depth, and decide when a hierarchy fits your data.
Take quizDistinguish full, complete, perfect, and balanced trees, and check whether linked nodes form a valid binary tree.
Take quizTrace insertion and deletion, check subtree ordering, and explain how tree height affects search.
Take quizFollow a priority through array-backed heaps, predict bubbling, and separate heap order from a fully sorted collection.
Take quizUse keys and values, recognize collisions, and reason about Map behavior and hash-table lookup costs.
Take quizTrace toy hashes, explain collisions and avalanche behavior, and choose hashing tools without confusing a digest with encryption.
Take quizBuild shared prefixes, distinguish words from partial matches, and delete entries without damaging their neighbors.
Take quizInterpret definite negatives and possible matches, follow bit updates, and weigh memory against unnecessary lookups.
Take quizModel directed and undirected relationships, read adjacency lists, and keep edges consistent as a graph changes.
Take quizTurn locations into row-column addresses, map clicks to cells, and choose how much detail a grid needs.
Take quizTranslate directions into coordinates and keep invalid candidate moves from changing the real position.
Take quizSeparate an existing cell from a usable one, trace collision checks, and keep movement and obstacle data consistent.
Take quizPredict the search frontier, rebuild routes from breadcrumbs, and explain the limits of shortest-step navigation.
Take quizTrace hash changes, reconstruct inclusion proofs, and separate snapshot integrity from trust and freshness.
Take quizFollow calls down to a base case and back again, then distinguish smaller subproblems from less total work.
Take quizCompare repeated recursion, shared memoization, and rolling iteration without confusing call count, depth, or precision.
Take quizTrace first-match and all-match searches, reason about equality, and include scan and result-storage costs.
Take quizMaintain a valid search interval, trace midpoint decisions, and account for sorting, duplicates, and access costs.
Take quizTrack discovery and exploration, compare queue and stack order, and read the returned nodes correctly.
Take quizExplore cyclic graphs, distinguish visitation from routes, and select a traversal that matches the task.
Take quizPredict worklist changes and separate the lab's visited order, discovery parents, and returned route.
Take quizRelax weighted routes, choose the cheapest frontier, and understand when a tentative distance becomes final.
Take quizRead tentative-distance snapshots, predict relaxations, and test weighted-route claims with controlled graph changes.
Take quizTrace minimum selection, compare the two collection variants, and weigh comparisons against swaps.
Take quizMove active values into a sorted prefix and explain stability, shifts, and nearly sorted inputs.
Take quizPartition around a pivot, trace the actual two-pointer code, and reason about balance, stack space, and ties.
Take quizFollow adjacent swaps, prove what a quiet pass means, and distinguish swap count from scan cost.
Take quizTranslate signed keys into count-table positions without losing numeric order or overlooking range costs.
Take quizMerge sorted runs, preserve equal-key order, and account for the real costs of array access and storage.
Take quizInspect random shuffles, distinguish expected work from guarantees, and see why luck is not a sorting strategy.
Take quizTrack equal-key records, combine sorting passes, and distinguish stable behavior from names and coincidences.
Take quizBuild frequency tables, place repeated values, and decide when the key range makes counting worthwhile.
Take quizTrace stable digit passes, understand the signed-number wrapper, and separate bucket size from total cost.
Take quizRecognize natural runs, follow stable merging, and understand which hybrid-sort details depend on the implementation.
Take quizChoose built-in sorts by their contracts, understand hybrid trade-offs, and avoid outdated runtime assumptions.
Take quizFind primes by crossing out composites, trace the code, and decide when a sieve is worth its memory.
Take quizPlan legal disk moves, follow the recursive calls, and see why a short program can describe an enormous job.
Take quizUse informed reveals to reason about switching, check a simulation, and spot when different rules change the odds.
Take quizBuild a fractal from smaller triangles, trace its stopping rule, and balance visible detail against growing work.
Take quizYour score comes with a review of missed concepts and links back to the relevant parts of the tutorial. Read those explanations, try a fresh attempt, and see what sticks. Score above 80% for a confetti celebration.
Want to keep track? After a quiz, connect your existing kirupa forum account and choose to save the result. Your results page shows every saved attempt, your best score for each topic, and an overall score based on your latest attempts.
:: Copyright KIRUPA 2026 //--