Question

What are the advantages and disadvantages of the various collision resolution strategies for hashes?

Answer 1

Linear probing

It does a linear search for an empty slot when a collision is identified

Advantages

Easy to implement

It always finds a location if there is one

Disadvantages

When clusters and keys fill most of the array after forming in adjacent slots of the table, the performance deteriorates

Double probing/hashing

The idea here is to make the offset to the next position probed depending on the key value. This is so it can be different for different keys.

Advantages

Good for double number generation

Smaller hash tables can be used.

Disadvantages

As the table fills up, the performance degrades.

Quadratic probing

It is used to resolve collisions in hash tables. It is an open addressing scheme in computer programming.

Advantage

It is more efficient for a closed hash table.

Disadvantage

Has secondary clustering. Two keys have same probe sequence when they hash to the same location.

Answer 2

Answer:

Vector: each vector position holds one

information. If the hashing function applied to a

set of elements determine the information I1,

I2, ..., In, so the vector V [1 ... n] is used to

represent the hash table.

! Vector + Chain List: Vector contains

pointers to lists that represent the

information.

Hashing Function

! The Hashing Function is responsible for generating a

index from a given key.

! Ideally, the function should provide unique indexes for the

set of possible input keys.

! Hashing function is extremely important,

because she is responsible for distributing the information through

Hash table.

Explanation:

Hope this helps :) -Mark Brainiest Please :)