Questions Quizzes Daily challenge System design My attempts

Loading questions…

Practice / Questions

Question bank.

Explore 2,015 questions across 22 categories. Choose a subject, format, and difficulty, then learn from each explanation.

Prefer a full quiz? Browse quizzes →

Find a question

Search questions

Category

Topic

Question format

Difficulty

121 questions found

Showing 81–100 of 121 results

1 2 3 4 5 6 7

Data structures · Matching
Difficulty: Medium
Match the descriptions to these sequences terms: Fixed-size array, Dynamic array, Singly linked list, Doubly linked list.
SequencesConcept relationships
Answer →
Data structures · Matching
Difficulty: Medium
Match the descriptions to these access disciplines terms: Stack, Queue, Deque, Ring buffer.

Access disciplinesConcept relationships

Data structures · Matching

Difficulty: Medium

Match the descriptions to these hashing fundamentals terms: Hash table, Bucket, Hash collision, Load factor.

Hashing fundamentalsConcept relationships

Data structures · Matching

Difficulty: Hard

Match the descriptions to these collision resolution terms: Separate chaining, Linear probing, Quadratic probing, Double hashing.

Collision resolutionConcept relationships

Data structures · Matching

Difficulty: Medium

Match the descriptions to these tree terminology terms: Root, Leaf, Parent, Subtree.

Tree terminologyConcept relationships

Data structures · Multiple Choice

Difficulty: Easy

A hash table chooses bucket = key mod 5. Which bucket receives integer key 17?

HashingBucket selection

Data structures · Multiple Choice

Difficulty: Easy

A hash table chooses bucket = key mod 6. Which bucket receives integer key 24?

HashingBucket selection

Data structures · Multiple Choice

Difficulty: Easy

A hash table chooses bucket = key mod 7. Which bucket receives integer key 31?

HashingBucket selection

Data structures · Multiple Choice

Difficulty: Easy

A hash table chooses bucket = key mod 8. Which bucket receives integer key 38?

HashingBucket selection

Data structures · Multiple Choice

Difficulty: Easy

A hash table chooses bucket = key mod 5. Which bucket receives integer key 45?

HashingBucket selection

Data structures · Multiple Choice

Difficulty: Easy

A hash table chooses bucket = key mod 6. Which bucket receives integer key 52?

HashingBucket selection

Data structures · Multiple Choice

Difficulty: Easy

A hash table chooses bucket = key mod 7. Which bucket receives integer key 59?

HashingBucket selection

Data structures · Multiple Choice

Difficulty: Easy

A hash table chooses bucket = key mod 8. Which bucket receives integer key 66?

HashingBucket selection

Data structures · Multiple Choice

Difficulty: Easy

A hash table chooses bucket = key mod 5. Which bucket receives integer key 73?

HashingBucket selection

Data structures · Multiple Choice

Difficulty: Easy

A hash table chooses bucket = key mod 6. Which bucket receives integer key 80?

HashingBucket selection

Data structures · Ordering / Sequencing

Difficulty: Easy

A FIFO queue receives job IDs [122, 488, 888, 626, 945] in that order. Arrange the IDs in removal order.

QueuesFIFO

Data structures · Ordering / Sequencing

Difficulty: Medium

Push [7392, 5448, 7940, 8238, 7824] onto an empty stack in the stated order. Arrange the values in successive pop order.

StacksLIFO

Data structures · Ordering / Sequencing

Difficulty: Easy

A FIFO queue receives job IDs [349, 201, 859, 761, 785] in that order. Arrange the IDs in removal order.

QueuesFIFO

Data structures · Ordering / Sequencing

Difficulty: Medium

Push [9085, 9645, 4257, 2201, 5873] onto an empty stack in the stated order. Arrange the values in successive pop order.

StacksLIFO

Data structures · Ordering / Sequencing

Difficulty: Easy

A FIFO queue receives job IDs [523, 388, 743, 787, 794] in that order. Arrange the IDs in removal order.

QueuesFIFO

Showing 81–100 of 121 results

1 2 3 4 5 6 7