Hashing

What is a hash table?

• A hash table is a type of table used for storing hash functions.
• A hash table is a data structure that stores key-value pairs.
• A hash table is a type of table used for storing hash browns.
• A hash table is a data structure that stores only keys, not values.

If several elements are competing for the same bucket in the hash table, what is it called?

• Diffusion

• Replication

• Collision

• Duplication

Let consider a list of numbers (34, 16, 2, 93, 80, 77. 51) and table size is 10. What is the order of elements in the hash table?

• null, null, 77, 16, null, 34, 93, 2, 51, 80

• 77, 16, 34, 93, 2, 51, 80

• 80, 51, 2, 93, 34, null, 16, 77, null, null

• 80, 51, 2, 93, 34, 16, 77

Consider a hash table with 10 slots and the collisions are linear probing. The following keys are inserted in the order: 15, 2, 1, 5, 20, 31, 12, 21, 17, 34.

• 20, 31, 2, 1, 12, 15, 5, 17, 21, 34

• 20, 1, 12, 31, 34, 5, 15, 21, 17, 2

• 20, 1, 2, 31, 12, 15, 5, 21, 17, 34

• 20, 31, 2, 1, 34, 15, 5, 21, 17, 12

If every item of the list maps to unique index in the hash table, the hash function is called ____________.

• hash free table

• collision table

• collision free table

• perfect hash table

If the hash function is h(key) = key % 5, so for which of the pair of values, the Collison will take place?

• 15 and 14

• 12 and 2

• 1 and 10

• 11 and 22

Which the following technique is not open addressing for solve collisions?

• Linear probing

• quadratic probing

• chaining

• rehashing

Which of the following hash functions is most likely to cause clustering in a hash table?

• hash(key) = key % size_table

• hash(key) = key / size_table

• hash(key) = key

• hash(key) = key * size_table