Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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).
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Machine Learning And Knowledge Discovery In Databases European Conference Ecml Pkdd 2010 Barcelona Spain September 2010 Proceedings Part 3 Lnai 6323

Authors: Jose L. Balcazar ,Francesco Bonchi ,Aristides Gionis ,Michele Sebag

2010th Edition

3642159389, 978-3642159381

More Books

Students also viewed these Databases questions