Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Q1. (50 Points) Solve question 5.1 at page 237 in your textbook. Illustrate your

ID: 3721483 • Letter: Q

Question

Q1. (50 Points) Solve question 5.1 at page 237 in your textbook. Illustrate your solutions as shown in Chapter 5 in your textbook or my examples. In this question, you may assume that the table size is 10.

Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function

h(x) = x (mod () 10), show the resulting

a. separate chaining hash table

b. hash table using linear probing

c. hash table using quadratic probing

d. hash table with second hash function h2(x) = 7 ? (x mod 7)

Please provide an original answer no photo please. Thank you

Explanation / Answer

Hi Friend,

Question is long.

Please post in part.

I have answered first 3.

Separating chaining hash table

arr[0]->

arr[1]->4371

arr[2]->

arr[3]->1323->6713

arr[4]->4344

arr[5]->

arr[6]->

arr[7]->

arr[8]->

arr[9]->4199->9679->1989

Hash table using linear probing

arr[0]->9679

arr[1]->4371

arr[2]->1989

arr[3]->1323

arr[4]->6713

arr[5]->4344

arr[6]->

arr[7]->

arr[8]->

arr[9]->4199

-Hash table using quadratic probing

arr[0]->

arr[1]->4371

arr[2]->9679

arr[3]->1323

arr[4]->4344

arr[5]->6173

arr[6]->1989

arr[7]->

arr[8]->

arr[9]->4199