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

ProblemCourse & topicStatus

DS:9921151Consider a hash table T of size m = 11 that resolves collisions by chaining.

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921152A chaining hash table has m slots and currently stores n distinct keys.

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921153Specify language-neutral pseudocode for a chaining hash table T that stores a set of distinct keys.

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921154Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921155Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921156Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921157Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921158n distinct keys are hashed independently and uniformly at random into a table of m slots.

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921159Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921160Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921161Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921162Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921163Design a dynamic chaining hash table that stores n distinct keys and whose table size m is always a power of 2…

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921164Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921165Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921166Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921167Let U be a finite universe of keys and let \mathcal H be a finite family of hash functions from U to…

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921168Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921169Let m=11.

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921170Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921171Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921172n distinct keys are inserted, one by one, into an initially empty chaining hash table of fixed size m.

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921173Mathematical problem title

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData Structures · Calculation

—

DS:9921174Compare two implementations that store n=1000 distinct one-word keys.

HashingData Structures Problem Solving

Hash tables and probabilistic performanceData 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.

Let T be a chaining hash table with m slots storing n keys, and let

\alpha=n/m

.

Consider an open-addressing hash table of size m=11 that uses linear probing with hash function

h(k,i)=(k+i)\bmod

…

Consider open addressing with quadratic probing

h(k,i)=(h'(k)+i^2)\bmod

m,

i=0,1,2,\ldots

, where

h'(k)=k\bmod

m.

Consider an open-addressing hash table of size m=13 that uses double hashing

h_1(k)=k\bmod

13,

h_2(k)=1+(k\bmod

12)…

An open-addressing table of size m=8 uses linear probing

h(k,i)=(h'(k)+i)\bmod

8.

(a) The division method uses

h(k)=k\bmod

m.

Consider an open-addressing table of size m=7 with linear probing

h(k,i)=(k+i)\bmod

7.

Let T be a chaining hash table with m slots storing n distinct keys,

\alpha=n/m

.

Let s be a string of length L whose characters are integers

s[0],s[1],\ldots,s[L-1]

.

An open-addressing table T[0..m-1] stores n distinct keys using a probe family h(k,i),

i=0,1,\ldots,m-1

, such that…

Consider open addressing in a table of size m storing n keys,

\alpha=n/m<1

, with no

\mathrm{DEL}

sentinels.

Consider a chaining hash table of size m=7 with

h(k)=k\bmod

7.

Let

n\ge

2 with n even, and consider a chaining hash table of m=n/2 slots storing n distinct keys, so

\alpha=2

.

A chaining hash table begins empty with m=4 slots,

h_m(k)=k\bmod

m, and insertion at the head of a chain.

Open addressing stores n<m keys in T[0..m-1] with no

\mathrm{DEL}

sentinels.