Question 1

A(n)______ maps the search key of a table item into a location that will contain the item.

Accepted Answer

A) hash function 
B) hash table 
C) AVL tree 
D) red-black tree 
A) hash function 
B) hash table 
C) AVL tree 
D) red-black tree

Question 2

The sequence of locations in a hash table that a collision resolution scheme examines is known as a(n)______ sequence.

Accepted Answer

A) iteration 
B) hash 
C) collision 
D) probe 
A) iteration 
B) hash 
C) collision 
D) probe

Question 3

A 2-3-4 tree requires more storage than a binary search tree.

Accepted Answer

A) True 
 B)False

Question 4

What is a bucket?

Accepted Answer

A bucket is an eleme

Question 5

What is a disadvantage of a 2-3-4 tree when compared with a binary search tree?

Accepted Answer

A 2-3-4 tree requires more sto

Question 6

Suppose we wanted to use a hash table to store people's names.Each name is a String object.What is wrong with using the length of the string as the hash value of each name?

Accepted Answer

Many names have the

Question 7

______ is a collision-resolution scheme that searches the hash table for an unoccupied location beginning with the original location that the hash function specifies and continuing at increments of 12,22,32,and so on.

Accepted Answer

A) Linear probing 
B) Double hashing 
C) Quadratic probing 
D) Separate chaining 
A) Linear probing 
B) Double hashing 
C) Quadratic probing 
D) Separate chaining

Question 8

The maximum height of a binary search tree of n nodes is ______.

Accepted Answer

A) n 
B) n - 1 
C) n / 2 
D) log2(n + 1) 
A) n 
B) n - 1 
C) n / 2 
D) log2(n + 1)

Question 9

Locating a particular item in a binary search tree of n nodes requires at most ______ comparisons.

Accepted Answer

A) n 
B) n * 3 
C) n / 2 
D) n - (n / 2) 
A) n 
B) n * 3 
C) n / 2 
D) n - (n / 2)

Question 10

What is meant by clustering? How does clustering affect the overall efficiency of hashing?

Accepted Answer

Clustering is the tendency of items to m

Question 11

A 4-node is found in a(n)______.

Accepted Answer

A) AVL tree 
B) 2-3 tree 
C) 2-3-4 tree 
D) red-black 
A) AVL tree 
B) 2-3 tree 
C) 2-3-4 tree 
D) red-black

Question 12

A 2-3 tree of height h always has at least ______ nodes.

Accepted Answer

A) h² 
B) h² - 2 
C) 2h 
D) 2h - 1 
A) h² 
B) h² - 2 
C) 2h 
D) 2h - 1

Question 13

Searching a 2-3 tree is ______.

Accepted Answer

A) O(n) 
B) O(log2ⁿ) 
C) O(log2ⁿ * n) 
D) O(n²) 
A) O(n) 
B) O(log2ⁿ) 
C) O(log2ⁿ * n) 
D) O(n²)

Question 14

Which of the following is NOT true about a red-black tree?

Accepted Answer

A) it is balanced 
B) its insertion operation requires one pass from root to leaf 
C) its deletion operation requires one pass from root to leaf 
D) it requires more storage than a 2-3-4 tree 
A) it is balanced 
B) its insertion operation requires one pass from root to leaf 
C) its deletion operation requires one pass from root to leaf 
D) it requires more storage than a 2-3-4 tree

Question 15

A node that contains two data items and has three children is called a ______.

Accepted Answer

A) 2-node 
B) 3-node 
C) double node 
D) triple node 
A) 2-node 
B) 3-node 
C) double node 
D) triple node

Question 16

A 2-3 tree is a binary tree.

Accepted Answer

A) True 
 B)False

Question 17

In the binary search tree implementation of the ADT table,the maximum number of comparisons required by the tableInsert operation is equal to ______.

Accepted Answer

A) the number of nodes in the binary search tree 
B) the height of the binary search tree 
C) the number of leaves in the binary search tree 
D) the number of internal nodes in the binary search tree 
A) the number of nodes in the binary search tree 
B) the height of the binary search tree 
C) the number of leaves in the binary search tree 
D) the number of internal nodes in the binary search tree

Question 18

A(n)______ is a tree in which each internal node has either two or three children,and all leaves are at the same level.

Accepted Answer

A) red-black tree 
B) 2-3 tree 
C) 2-3-4 tree 
D) AVL tree 
A) red-black tree 
B) 2-3 tree 
C) 2-3-4 tree 
D) AVL tree

Question 19

What is the advantage of using a variation of a binary search tree,such as a 2-3 tree or a 2-3-4 tree,instead of a binary search tree?

Accepted Answer

In a binary search tree,insertions and d

Question 20

In a 2-3-4 tree,when is a 4-node split during an insertion operation?

Accepted Answer

During insertion,a 4-node is s

A(n)______ maps the search key of a table item into a location that will contain the item.

The sequence of locations in a hash table that a collision resolution scheme examines is known as a(n)______ sequence.

A 2-3-4 tree requires more storage than a binary search tree.

What is a bucket?

What is a disadvantage of a 2-3-4 tree when compared with a binary search tree?

Suppose we wanted to use a hash table to store people's names.Each name is a String object.What is wrong with using the length of the string as the hash value of each name?

______ is a collision-resolution scheme that searches the hash table for an unoccupied location beginning with the original location that the hash function specifies and continuing at increments of 12,22,32,and so on.

The maximum height of a binary search tree of n nodes is ______.

Locating a particular item in a binary search tree of n nodes requires at most ______ comparisons.

What is meant by clustering? How does clustering affect the overall efficiency of hashing?

A 4-node is found in a(n)______.

A 2-3 tree of height h always has at least ______ nodes.

Searching a 2-3 tree is ______.

Which of the following is NOT true about a red-black tree?

A node that contains two data items and has three children is called a ______.

A 2-3 tree is a binary tree.

In the binary search tree implementation of the ADT table,the maximum number of comparisons required by the tableInsert operation is equal to ______.

A(n)______ is a tree in which each internal node has either two or three children,and all leaves are at the same level.

What is the advantage of using a variation of a binary search tree,such as a 2-3 tree or a 2-3-4 tree,instead of a binary search tree?

In a 2-3-4 tree,when is a 4-node split during an insertion operation?

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Graphs

External Methods

Filters

Exam 13: Advanced Implementations of Tables

A(n)______ maps the search key of a table item into a location that will contain the item.

The sequence of locations in a hash table that a collision resolution scheme examines is known as a(n)______ sequence.

A 2-3-4 tree requires more storage than a binary search tree.

What is a bucket?

What is a disadvantage of a 2-3-4 tree when compared with a binary search tree?

Suppose we wanted to use a hash table to store people's names.Each name is a String object.What is wrong with using the length of the string as the hash value of each name?

______ is a collision-resolution scheme that searches the hash table for an unoccupied location beginning with the original location that the hash function specifies and continuing at increments of 12,22,32,and so on.

The maximum height of a binary search tree of n nodes is ______.

Locating a particular item in a binary search tree of n nodes requires at most ______ comparisons.

What is meant by clustering? How does clustering affect the overall efficiency of hashing?

A 4-node is found in a(n)______.

A 2-3 tree of height h always has at least ______ nodes.

Searching a 2-3 tree is ______.

Which of the following is NOT true about a red-black tree?

A node that contains two data items and has three children is called a ______.

A 2-3 tree is a binary tree.

In the binary search tree implementation of the ADT table,the maximum number of comparisons required by the tableInsert operation is equal to ______.

A(n)______ is a tree in which each internal node has either two or three children,and all leaves are at the same level.

What is the advantage of using a variation of a binary search tree,such as a 2-3 tree or a 2-3-4 tree,instead of a binary search tree?

In a 2-3-4 tree,when is a 4-node split during an insertion operation?

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Graphs

External Methods

Filters