Question: Q 1 : Hashing ( 2 0 D ) A hash table with m = 1 hat ( 1 ) slots is requested to be

Q1: Hashing (20D)
A hash table with m=1hat(1) slots is requested to be nlled sequentially with the numbers 10,22,31,4,17,15,28,21,x.
a) Place the keys using the hash function h(lo -k mod 11 and Loear probing method. Given that key X is placed exactly at the 1=5 th probing (starting from 1=0), what could be the possible value (s) of x?(select all that apply).
a)23-
b)36
c)8
d)16
e)90
o)70
g.71
h)14
b) Assuming x=33, place the same keys into the 11-slot hash table using the functions h1(k)=kmodm and h2(k)=1+(kmod(m-1)) with double probing method (you should draw the final state of hash table).
 Q1: Hashing (20D) A hash table with m=1hat(1) slots is requested

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!