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

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 identifiers it is known as

• Knock

• Bang

• Collisions

• DoubleHash

Divide the item into equal-size pieces

Add the pieces together

Perform the mod step to get an address

Which hashing method does this describe

• folding method

• alphanumeric

• mid-square

• mod

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

• True

• False

• It depends

• In most cases yes, but not always

When two identifiers are hashed into the same bucket

• Collision

• Overflow

• Synonyms

• Stack

When a new identifier is hashed into full bucket

• Collision

• synonyms

• overflow

• factor

n/(sb) denotes the

• identifier density

• Loading density

• identifier Factor

• None