HashTables

What is the status after adding 7

• 
• 
• 
• 

What is the status after adding 10

• 
• 
• 
• 

when an algorithm generates the same address for different primary keys it is known as

• Knock

• Bang

• Collisions

• DoubleHash

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

IF KEY = 5432 and numberOfSlots = 100

Address = ?

• 5

• 4

• 32

• 5432

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

IF KEY = 5432 and numberOfSlots = 1000

Address = ?

• 5

• 432

• 543

• 5432

A hash table is

• an abstract data structure

• an array

• an integer

• made of pine

Hashing gives each item

• A sequential address

• A logarithmic address

• No address

• A unique address

Explain 'Delete' in HashTables

• The value is removed and the slot is made completely empty

• The location is available with no history

• The location is empty

• The location is empty and marked with an indication that it used to store a value