Browsing still works.Sign in to use progress, saved problems and private labels. Problem search and previews remain available. Progress labels
IndependentSolved with helpIncorrect / unresolvedDraft in progressNot attemptedReview due
Problem results
ProblemCourse & topicStatus
Arrays, linked structures, stacks, queues, and amortizationData Structures · Mixed review
—Arrays, linked structures, stacks, queues, and amortizationData Structures · Mixed review
—Arrays, linked structures, stacks, queues, and amortizationData Structures · Mixed review
—Arrays, linked structures, stacks, queues, and amortizationData Structures · Mixed review
—Arrays, linked structures, stacks, queues, and amortizationData Structures · Mixed review
—Search trees and balanced treesData Structures · Mixed review
—Search trees and balanced treesData Structures · Mixed review
—Search trees and balanced treesData Structures · Mixed review
—Hash tables and probabilistic performanceData Structures · Mixed review
—Hash tables and probabilistic performanceData Structures · Mixed review
—Heaps, priority queues, and disjoint setsData Structures · Mixed review
—Heaps, priority queues, and disjoint setsData Structures · Mixed review
—Heaps, priority queues, and disjoint setsData Structures · Mixed review
—Graph representations and traversalsData Structures · Mixed review
—Graph representations and traversalsData Structures · Mixed review
—DS:9921001Mathematical problem title
Adt InvariantsData Structures Problem Solving
Abstract data types, representation, and invariantsData Structures · Calculation
—Abstract data types, representation, and invariantsData Structures · Calculation
—Abstract data types, representation, and invariantsData Structures · Calculation
—Abstract data types, representation, and invariantsData Structures · Calculation
—Abstract data types, representation, and invariantsData Structures · Calculation
—Abstract data types, representation, and invariantsData Structures · Calculation
—Abstract data types, representation, and invariantsData Structures · Calculation
—Abstract data types, representation, and invariantsData Structures · Calculation
—Abstract data types, representation, and invariantsData Structures · Calculation
—Showing 24 of 315 matching problems.
A wraparound write fills stale slots; size, not head-equals-tail, decides full versus empty
A duplicate minimum must sit on the min-stack, or one pop forgets the other
A two-stack queue is FIFO by an out-then-in reading, and two times in-size pays for every transfer
A persistent push allocates one node and shares the old spine
A stable in-place list partition relinks existing nodes and does not need a sentinel
A two-child BST delete must splice the successor, not promote the right child
A t=2 B-tree insert splits the full leaf on 40 before writing 35
Deleting car only clears a terminal; deleting cat prunes a leaf
A linear-probe delete is a tombstone; insert 45 remembers slot 4
Three keys that share only A0 and B0 force a cuckoo rehash
Bottom-up heap construction is linear because most subtrees are short
Decrease-key in an indexed min-heap must restore heap order and the inverse position map
Binomial-heap meld adds degree vectors, including a three-tree carry
Multi-source BFS distances depend on the source set, not on parent choices
Recursive DFS is simulated by frames, not by an eager vertex stack
The Stack ADT over a universe U is specified by the following operations and contracts.
A singly linked list representation of a finite sequence of integers uses nodes with fields \mathrm{data} (an integ…
A bounded queue of integers is stored in an array A[0..n-1] with n = 6, together with integers \mathrm{front}, \mat…
Let V be a dynamic array of n elements stored in a buffer of capacity c, with the invariant 0 \le n \le c and c \ge 1.
Design a representation of the Queue ADT that uses two Stack ADT objects \mathrm{In} and \mathrm{Out} as its only a…
A binary search tree (BST) T stores pairwise-distinct keys from a totally ordered universe.
A binary min-heap of n pairwise-distinct integers is stored in an array H[1..n] (1-based) satisfying two invariants…
Let H[1..n] be an array.
Consider a hash table that resolves collisions by separate chaining.