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: Priority Disjoint Build a practice set

ProblemCourse & topicStatus

DS:9921201`Bubble-Down`(A,i,n) is specified as follows on a 1-based array that is a complete binary tree.

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921202(Honors) An array A[1..n] is said to be heap-ordered if it is a binary min-heap.

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921203Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921204Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921205In a disjoint-set forest with union by rank and no path compression, prove: (i) the rank of a node never changes…

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921206Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921207Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921208Implement disjoint sets with union by size (also called weighted union) instead of rank: each root stores the…

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921209Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921210(Honors) Let F be a disjoint-set forest on n elements that uses both union by rank and path compression.

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921211Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921212Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921213Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921214Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921215Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921216Consider the following generic search, written in language-neutral pseudocode.

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921217Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921218Let G be an undirected graph, not necessarily connected, given by adjacency lists.

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921219Let G=(V,E) be a directed graph given by adjacency lists.

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921220Mathematical problem title

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921221Kahn's algorithm on a directed graph G=(V,E) is: ``` KAHN(G) for each v ∈ V indeg[v] ← 0 for each edge u → v…

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921222Let G be a DAG given by adjacency lists.

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921223For each of the following families of graphs, state which of adjacency matrix, adjacency lists, or edge list is…

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData Structures · Calculation

—

DS:9921224An undirected graph G is represented by an adjacency matrix A.

Priority DisjointData Structures Problem Solving

Heaps, priority queues, and disjoint setsData 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 disjoint-set (union-find) data structure maintains a partition of a universe

\{1,\ldots,n\}

.

Augment the forest implementation of Problem 203 with union by rank: each node x stores an integer

\mathrm{rank}[x]

…

Path compression during Find(x) resets

p[y]\leftarrow

r for every node y on the path from x to the root r…

Consider three path-reduction rules applied to the Find path

x=x_0,x_1,\ldots,x_t=r

, where

p[x_i]=x_{i+1}

and r…

You are given an undirected graph G=(V,E) with

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

presented as an unordered list of m edges, and you…

Let G=(V,E) be an undirected graph with n=|V| vertices labeled

0,1,\ldots,n-1

and m=|E| edges.

A directed graph on a fixed vertex set

\{0,1,\ldots,n-1\}

must support the operations

\mathrm{ADD\text{-}EDGE}(u,v)

…

Let G be the undirected graph with vertex set

\{A,B,C,D,E,F,H\}

and adjacency lists written in the given…

Let G be the directed graph with vertex set

\{1,2,3,4,5,6\}

and adjacency lists in increasing order of head: ``` 1:…

Let G=(V,E) be an undirected connected graph, and let

p[x_i]=x_{i+1}

V.

An

n\times

n grid graph has a vertex for every pair (r,c) with

0\le

r<n and

0\le

c<n.

Let G be the directed graph with vertex set

\{A,B,C,D,E,F\}

and directed edges

A\to

B,

A\to

C,

B\to

D,

C\to

D…