Skip to main content

Train Courses Problems Proof Blocks Tools Progress Account

⌄

AccountSign-in, membership, and settings Current courseCalculus IThemeAbout ProofAnvilLoading account…

Problem library

Find a problem

Search by course or topic.

Loading the problem library…

TrainCoursesProblemsProgressMoreTrain Courses Problems Progress

More

Proof Blocks Tools Account

ProofAnvil Practice$19 USD monthly · cancel any time

Pricing FAQ Features Roadmap Use with your agent Support Terms Privacy Refunds

Practice problems with hints and solutions · ProofAnvil

Problem library

Find a problem

Search by course or topic.

Search problems

Filters · 2 active

Area

AllMathPhysics

SubjectCourseTopic

Topic choices for Data Structures are shortened. Search still covers every problem.

StatusSkill

Skills match the applied subject and course.

Problem styleFind a private labelPrivate labelPrivate labels are visible only to you.Private labels ready.Favorites

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

Sort

ProblemsClear skill: Adt Invariants Build a practice set

ProblemCourse & topicStatus

DS:9921001The Stack ADT over a universe U is specified by the following operations and contracts.

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921002Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921003Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921004Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921005Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921006A binary search tree (BST) T stores pairwise-distinct keys from a totally ordered universe.

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921007A binary min-heap of n pairwise-distinct integers is stored in an array H[1..n] (1-based) satisfying two…

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921008Let H[1..n] be an array.

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921009Consider a hash table that resolves collisions by separate chaining.

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921010Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921011Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921012Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921013A List ADT object L stores a sequence of n elements and provides a cursor abstraction.

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921014Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921015Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921016Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921017Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921018Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921019A circular doubly linked list with a dummy sentinel S represents a sequence of n integers.

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921020Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921021Mathematical problem title

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921022A hash table with separate chaining as in Problem 9 maintains the invariant that the bucket array length m is…

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921023The Sequence ADT (also called Vector or ArrayList) stores a sequence A[0..n-1] of n elements of U and supports…

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

DS:9921024Let T be a finite BST on pairwise-distinct keys satisfying the invariant of Problem 6.

Adt InvariantsData Structures Problem Solving

Abstract data types, representation, and invariantsData Structures · Calculation

—

Showing 24 of 50 matching problems.

Private labels

Edit private labels

Add labels that only you can see.

Problem

Current labels

Private labels are unavailable. Close this editor and try again.

New label

Use a short label.

A singly linked list representation of a finite sequence of integers uses nodes with fields

\mathrm{data}

(an…

A bounded queue of integers is stored in an array A[0..n-1] with n = 6, together with integers

\mathrm{front}

…

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…

An open-address hash table stores keys from U

\cup

\{\mathrm{EMPTY},\mathrm{DELETED}\}

in an array T[0..m-1], with…

The SortedList ADT maintains a finite multiset of integers and supports: -

\mathrm{RankInsert}(x)

: inserts one…

The Deque ADT (double-ended queue) over U has operations

\mathrm{NewD}()

,

\mathrm{PushFront}(d,x)

…

A disjoint-set (Union-Find) structure maintains a partition of the set

\{1,\ldots,n\}

.

An AVL tree is a BST (as in Problem 6) in which every node u additionally stores an integer

u.\mathrm{height}

, and…

[Honors] Let T be an AVL tree on

n\ge

1 nodes, using the height convention of Problem 15

(h(\mathrm{NIL})=-1)

.

The Graph ADT for a directed graph on a vertex set

V=\{1,\ldots,n\}

supports: -

\mathrm{AddEdge}(u,v)

: requires…

A PriorityQueue ADT of pairwise-distinct keys from a totally ordered universe supports: -

\mathrm{Insert}(x)

…

A rooted binary tree is either

\mathrm{NIL}

or a node with fields

\mathrm{left}

and

\mathrm{right}

, each…

The following potential-based accounting is proposed for a stack that supports

\mathrm{Push}

,

\mathrm{Pop}

, and…