Which probing applies a hash function until it finds an empty space or the key that is sought for?
Linear
none of the above
What does separate chaining allow for in the case of collisions?
Allows the hash table to accommodate more than one item in the same location
Pick a correct example of Quadratic Probing increments:
A) 1, 2^2, 3^3, etc
B) 2^0, 2^1, 2^2, etc
C) 1^2, 2^2, 3^2, etc
D) 1^1, 2^2, 3^3, etc
What are two ways to handle hashing collisions?
1.Move down one at a time till a free space is found. 2.Move down n^2 where n is how many times you have collided and moved.
what is a hash collision?
A,two distinct pieces of data have the same hash value
B.two distinct pieces of data have the different hash value
C.it hold 3 values at once
D.none of the above
Separate Chaining allows the hash table to accommodate more than one item in the same location.
Double Hasing uses two has functions what does each do?
one specifies the first location, the other gives the step size.
Which type of probing searches the hash table at the beginning at the original specified by the hash function and continuing at increments of 1^2, 2^2, 3^2, ...?
A) Linear Probing
B) Square Probing
C) Polynomial Probing
D) Quadratic Probing
What does Separate Chaining do?
Allows the hash table to accommodate more than one item in the same location (each location is a linked list). This makes the hash table dynamic
What searches the hash table sequentially, starting from the original locatiom specified by the hash function?
A. Linear Probing
B. Bilinear Probing
C. Circular Probing
D. Alien Probing
What is separate chaining?
A) Each location in a hash table is a linked list. Effectively, it's dynamic.
B) Making each has table a linked list
C) None of the above
Which of the following is NOT a type of collision handling?
A. Separate chaining
B. Linear probing
C. Double Hashing
D. Trigonometic probing
In separate chaining, what is the load factor?
A. the load factor is the average length of all the lists, including the lists with the length of zero
B. the load factor is the shortest length of all the lists, including the lists with the length of zero
C. the load factor is the longest length of all the lists, including the lists with the length of zero
D. the load factor is the average length of all the lists, excluding the lists with the length of zero
When using separate chaining for collision handling in a hash table the load factor is the average length of all of the list.
collision resolution schemes that probe for an empty, or open, location in the hash table
What is the difference between separate chaining and open addressing?
Separate chaining uses linked lists as each index of the has table, and pushes older entries back from the front when new entries are provided. Open adressing uses two types of probing (linear and quadratic) to find an open location within the hash table.
