Y13 Alevel CS Hash tables

If a list of items is in random order use a

• Binary search

• Linear Seach

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

• Knock

• Bang

• Collisions

• DoubleHash

a synonym is

• a word bank

• a key

• a collision

• a list

What is the status after adding 10

• 
• 
• 
• 

What is the status after adding 7

• 
• 
• 
• 

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