b.) Suppose we use an Open-Addressing Hashing method with a 31

element hash table (first index starts at “0”) and our Hash function is

defined as:

H(key)=key % tablesize;

But now, suppose we want to insert an item with Key=45 but there is a

collision when we attempt the initial insertion. What are the next

four (4) locations we will try (assuming they also have collisions) if we

are using Quadratic Probing?

element hash table (first index starts at “0”) and our Hash function is

defined as:

H(key)=key % tablesize;

But now, suppose we want to insert an item with Key=45 but there is a

collision when we attempt the initial insertion. What are the next

four (4) locations we will try (assuming they also have collisions) if we

are using Quadratic Probing?

### Recently Asked Questions

- Given the following data set: 1,2,2,3,3,3,4,4,4,4,5,5,5,5,5,5 How many numbers are in the lower quartile?

- Discuss why carbon monoxide affects binding of oxygen to Hb and state the health consequences of CO poisoning and possible treatments

- Event Table showing events, stimulus, response, and outputs of a clinical equipment release and usage