untitled

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

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

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

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

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

• True

• False

• It depends

• In most cases yes, but not always

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

What does the acronym ADT stand for?

What are you aiming to avoid when creating a suitable method for dealing with collisions in a hash table?

• Clustering

• Merging

• Cluttering