Hash Tables

Hashing gives each item

• A sequential address

• A logarithmic address

• No address

• A unique address

A hash table is

• an abstract data structure

• an array

• an integer

• made of pine

A hash table uses a hash function (algorithm) to compute an index

• True

• False

• It depends

• In most cases yes, but not always

What is a hash table used for?

• To illustrate the concept of data structures

• To handle collisions in hashing

• To index and retrieve items in a database

• To store the original string

What is the purpose of hashing in computer science?

• To transform a string of characters into a shorter length value

• To illustrate the concept of data structures

• To distribute keys in an array using a hash function

• To store and retrieve keys in a rapid manner

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

IF KEY = 5432 and numberOfSlots = 1000

Address = ?

• 5

• 432

• 543

• 5432

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

IF KEY = 5432 and numberOfSlots = 100

Address = ?

• 5

• 4

• 32

• 5432

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

• Knock

• Bang

• Collisions

• DoubleHash

What is the status after adding 10

• 
• 
• 
• 

What is the status after adding 7

• 
• 
• 
•