 

NEW!
Textbook Solutions Expert Q&A Practice  

Find solutions for your homework Search

home / study / engineering / computer science / computer science questions and answers / 3. draw the 11-item hash table resulting from hashing …

Post a question
Your question has been answered Answers from our experts for your toug
homework questions
Let us know if you got a helpful answer. Rate this answer
Enter question

Question: 3. Draw the 11-item hash table resulting from hashing the key…
See this question in the app Continue to post
5 questions remaining

Snap a photo from yo

phone to post a ques

My Textbook Solutions

A
tex

Computer...

10th Edition

Spreadsheet
Show transcribed image text Modeling &...
8th Edition

View all solutions

Expert Answer

Anonymous answered this

22 answers
Was this answer helpful? 0 0 Computer Science Cheg
tutors who can help righ
3.
now
given 11 item 23, 55, 24, 99, 34, 105, 22, 50, 31, 27, 16

(a) Teja T.
BITS Pilani
has function h(i) = (i +5) mod 11
Gourav D.
Stony Brook Univers…

Bao P.
Oregon State Unive…

Find me a tutor
 
NEW!
Textbook Solutions Expert Q&A Practice  

i is 23 then h(23) = (2*23 + 5) mod 11 = 7

i is 55 then h(55) = (2*55 + 5) mod 11 = 5 so on.

(b)

compute h(x) = (i +5 ) mod 11 slot is full then

if collision occur h(x) = (h(x)+k) mod 11 k=1, 2, 3... 11

(c)

quadratic probing
 
NEW!
Textbook Solutions Expert Q&A Practice  

compute h(x) = (i +5 ) mod 11 slot is full then

if collision occur h(x) = (h(x) + k2) where k is key , k =1, 2, 3 ....

(d)

double hashing

compute h(x) = (i +5 ) mod 11 slot is full then

if slot is full then h(x) = (h(x) + h'(x)) mod 11

h'(x) = 7 - (k mod 7) is double hash function.

4.

(a)

initial binary tree

add 31 to

add 41 to
 
NEW!
Textbook Solutions Expert Q&A Practice  

add 25 to binary tree

add 59 to binary tree

add 29 to binary tree

add 27 to binary tree

add 12 to binary tree

add 14 to binary tree

(b)

delete using inorder successor

we can delete using inorder predecessor

 Comment


 
NEW!
Textbook Solutions Expert Q&A Practice  

Up next for you in Computer Science

9.6 1. (10 marks) Draw the

11-item hash table that
results from using the
hash
f ti h() (21 5) d See more questions
for subjects you study

See answer See answer

ABOUT CHEGG

LEGAL & POLICIES

CHEGG PRODUCTS AND SERVICES

CHEGG NETWORK

CUSTOMER SERVICE

© 2003-2020 Chegg Inc. All rights reserved.