Hashing

A hash function f defined as f(key) = key mod 7, with linear probing insert the keys 37, 38, 72, 48, 98, 11, 56,  into a table indexed from 0, in which location the key 11 will be stored (Count table index 0 as 0th location)?

• 3

• 4

• 5

• 6

Which collision resolution technique involves placing collided elements in the next available empty slot in the hash table? 

• 1. Linear probing

• 1. Quadratic probing 

• 1. Separate chaining

• 1. Double hashing 

In hashing, collision results when _______.

• 1. an attempt is made to insert a record at full primary bucket.

• 1. an attempt is made to insert a record anywhere in primary bucket.

• 1. an attempt is made to insert a record at empty primary bucket.

• 2. an attempt is made to delete a record at full primary bucket.

In hashing, collision resolution is carried out by close addressing. Which of the following is close addressing technique –

I. Double hashing

II. Separate Chaining

• Only I

• Only II

• Both I and II

• None

What is a hash table?

• A structure that maps values to keys

• A structure that maps keys to values

• A structure used for storage

• A structure used to implement stack and queue

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

• Diffusion

• Replication

• Collision

• Duplicate

What is a hash function?

• A function has allocated memory to keys

• A function that computes the location of the key in the array

• A function that computes the location of the values in the stack

• A function that creates an array

In simple uniform hashing, what is the search complexity?

• O(n)

• O(logn)

• O(nlogn)

• O(1)

______ is an application of hash table.

• Dictionary

• Symbol Table

• Look up table

• All of the above

Collision is resolved by ____.

• Linear probing

• Double hashing

• Quadratic probing

• All of the above