Answered: Given a hashing function hash(x) = ((x…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

20 a) Given a hashing function hash(x) = ((x * x) + x) % 11, Insert the value 17 into each hash table using the rules specified below. Note that some of the boxes in each hash table are already full. If there’s a collision, start the probing at i = 0 and increment from there if you collide.

b) After we insert our new data (that 17) into these hash tables, should we resize and rehash the values? Why or Why not?

c) If this was a hash table using separate chaining instead of linear probing, would it be time to rehash after we insert 17?

Linear Probing having probe(i) = ( hash(x) + (i + 1) ) % 11
10
11
6
15
1
2
4
5
6
7
10
Quadratic Probing having probe(i) = ( hash(x) + (i^2) ) % 11
( hash(x) + (i^2) ) % 11
%3D
10
11
15
1
3
4
5
6
7
8
9
10
9,
3.
2.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions