Question

sets, dictionaties and hasing questions

1: Explain how hashing can provide constant-time access to a data structure.

2: What causes collisions? Give an example of a collision.

3: How does the linear method for resolving collisions work? Use an example to explain.

4: What causes clustering?

5:

What is the load factor for an array of length 30 with 10 items. O 1 0.3 10 30

6:

Answer 1

As per HOMEWORKLIB POLICY, I am answering only first 4 questions. In order to get the solution of remaining questions, please upload them again.

1.) Since based on the key-index mapping, you can easily find the location of the value stored.

2.) When two keys have the same result while calculating hash values.

3.) Linear method finds the next empty location to store the data. Consider below example, which will clarify all three points:

consider keys are 45,2,84.

and hash function = key%3, array is of size 3.

So for 45, location will be 0, for 2 location will be 2 and for 84, there will be a collision, so with the help of linear probing, 84 will store at 1.

4.) If hash function is producing near by results for each key, or small of array is too small.