Hash Table in C

If our function is X % 10, where we would put 392?

• 2
• 9

• 3

• 0

If our function is X % 5, where we would put 63?

Using chaining, how many list items would be have to search through if we are searching for 120?

• 3

• 1

• 2

• 0

Answer explanation

3 (bin 0 has 3 items in the list)

If our hash function is (x+2) % 9, where would 66 be stored?

• 6

• 3

• 5

• 2

Hashing gives each item

• A sequential address

• A logarithmic address

• No address

• A unique address

Address <----- key MOD(numberOfSlots)

IF KEY = 5432 and numberOfSlots = 100

Address = ?

• 5

• 4

• 32

• 5432

What is the status after adding 10

• 
• 
• 
• 

What is the status after adding 7

• 
• 
• 
• 

The case in which a key other than the desired one is kept at the identified location is called?

• Hashing

• Collision

• Chaining

• Open addressing

Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are true?

i. 9679, 1989, 4199 hash to the same value

ii. 1471, 6171 has to the same value

iii. All elements hash to the same value

iv. Each element hashes to a different value

• i only

• ii only

• i and ii only

• iii or iv