Question 1

What is the digit analysis method?

Accepted Answer

In the digit analysis method, the index is formed by extracting, and then manipulating, specific digits from the key.

Question 2

The ____________ is the maximum percentage occupancy allowed in the hash table before it is resized.

Accepted Answer

A)  Load Factor 
B)  Hashing Factor 
C)  Thrashing Limit 
D)  None of the above 
A)  Load Factor 
B)  Hashing Factor 
C)  Thrashing Limit 
D)  None of the above A

Question 3

The division method is not very effective when dealing with an unknown set of key values.

Accepted Answer

A) True 
 B)False  False

Question 4

Why is deletion from an open addressing implementation a problem?

Accepted Answer

Because of the way that a path

Question 5

In hashing, elements are stored in a hash table, with their location in the table determined by a ______.

Accepted Answer

The answer of In hashing, elements are stored in a...

Question 6

The situation where two elements or keys map to the same location in the table is called a collision.

Accepted Answer

A) True 
 B)False

Question 7

The _____________ method and the mid-square method may also be effectively used with strings by manipulating the binary representations of the characters in the string.

Accepted Answer

A)  Division 
B)  Extraction 
C)  Shift Folding 
D)  Length Dependent 
A)  Division 
B)  Extraction 
C)  Shift Folding 
D)  Length Dependent

Question 8

In the shift folding method, the parts of the key are _______ together to create the index.

Accepted Answer

A)  Added 
B)  Subtracted 
C)  Multiplied 
D)  None of the above 
A)  Added 
B)  Subtracted 
C)  Multiplied 
D)  None of the above

Question 9

What are linear probing, quadratic probing, and double hashing?

Accepted Answer

Linear probing, quadratic prob

Question 10

Java provides a hashcode method for all objects.

Accepted Answer

A) True 
 B)False

Question 11

The ______ method for handling collisions looks for another open position in the table other than the one to which the element is originally hashed.

Accepted Answer

The answer of The ______ method for handling collisions looks...

Question 12

The division method is very effective when dealing with an ______ set of key values.

Accepted Answer

The answer of The division method is very effective when...

Question 13

The length-dependent method and the mid-square method must not be used with strings.

Accepted Answer

A) True 
 B)False

Question 14

In hashing, elements are stored in a hash table, with their location in the table determined by a hashing function.

Accepted Answer

A) True 
 B)False

Question 15

The situation where two elements or keys map to the same location in the table is called a __________.

Accepted Answer

A)  Collision 
B)  Tie 
C)  Chaining 
D)  None of the above 
A)  Collision 
B)  Tie 
C)  Chaining 
D)  None of the above

Question 16

What is the load factor and how does it affect table size?

Accepted Answer

The load factor is the maximum percentag

Question 17

The open addressing method for handling collisions looks for another open position in the table other than the one to which the element is originally hashed.

Accepted Answer

A) True 
 B)False

Question 18

Extraction involves using _________ of the element's value or key to compute the location at which to store the element.

Accepted Answer

A)  All 
B)  Only a part 
C)  None 
D)  None of the above 
A)  All 
B)  Only a part 
C)  None 
D)  None of the above

Question 19

The chaining method for handling __________ simply treats the hash table conceptually as a table of collections rather than as a table of individual cells.

Accepted Answer

A)  Division 
B)  Extraction 
C)  Collisions 
D)  Chaining 
A)  Division 
B)  Extraction 
C)  Collisions 
D)  Chaining

Question 20

In hashing, elements are stored in a hash table, with their _________ in the table determined by a hashing function.

Accepted Answer

A)  Order 
B)  Location 
C)  Precedence 
D)  None of the above 
A)  Order 
B)  Location 
C)  Precedence 
D)  None of the above

What is the digit analysis method?

The ____________ is the maximum percentage occupancy allowed in the hash table before it is resized.

The division method is not very effective when dealing with an unknown set of key values.

Why is deletion from an open addressing implementation a problem?

In hashing, elements are stored in a hash table, with their location in the table determined by a ______.

The situation where two elements or keys map to the same location in the table is called a collision.

The _____________ method and the mid-square method may also be effectively used with strings by manipulating the binary representations of the characters in the string.

In the shift folding method, the parts of the key are _______ together to create the index.

What are linear probing, quadratic probing, and double hashing?

Java provides a hashcode method for all objects.

The ______ method for handling collisions looks for another open position in the table other than the one to which the element is originally hashed.

The division method is very effective when dealing with an ______ set of key values.

The length-dependent method and the mid-square method must not be used with strings.

In hashing, elements are stored in a hash table, with their location in the table determined by a hashing function.

The situation where two elements or keys map to the same location in the table is called a __________.

What is the load factor and how does it affect table size?

The open addressing method for handling collisions looks for another open position in the table other than the one to which the element is originally hashed.

Extraction involves using _________ of the element's value or key to compute the location at which to store the element.

The chaining method for handling __________ simply treats the hash table conceptually as a table of collections rather than as a table of individual cells.

In hashing, elements are stored in a hash table, with their _________ in the table determined by a hashing function.

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Linked Structures - Stacks

Queues

Lists

Iterators

Recursion

Searching and Sorting

Trees

Binary Search Trees

Heaps and Priority Queues

Sets and Maps

Graphs

UML

Object-Oriented Design

Filters

Exam 14: Multi-Way Search Trees

What is the digit analysis method?

The ____________ is the maximum percentage occupancy allowed in the hash table before it is resized.

The division method is not very effective when dealing with an unknown set of key values.

Why is deletion from an open addressing implementation a problem?

In hashing, elements are stored in a hash table, with their location in the table determined by a ______.

The situation where two elements or keys map to the same location in the table is called a collision.

The _____________ method and the mid-square method may also be effectively used with strings by manipulating the binary representations of the characters in the string.

In the shift folding method, the parts of the key are _______ together to create the index.

What are linear probing, quadratic probing, and double hashing?

Java provides a hashcode method for all objects.

The ______ method for handling collisions looks for another open position in the table other than the one to which the element is originally hashed.

The division method is very effective when dealing with an ______ set of key values.

The length-dependent method and the mid-square method must not be used with strings.

In hashing, elements are stored in a hash table, with their location in the table determined by a hashing function.

The situation where two elements or keys map to the same location in the table is called a __________.

What is the load factor and how does it affect table size?

The open addressing method for handling collisions looks for another open position in the table other than the one to which the element is originally hashed.

Extraction involves using _________ of the element's value or key to compute the location at which to store the element.

The chaining method for handling __________ simply treats the hash table conceptually as a table of collections rather than as a table of individual cells.

In hashing, elements are stored in a hash table, with their _________ in the table determined by a hashing function.

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Linked Structures - Stacks

Queues

Lists

Iterators

Recursion

Searching and Sorting

Trees

Binary Search Trees

Heaps and Priority Queues

Sets and Maps

Graphs

UML

Object-Oriented Design

Filters