Question

10. Submission In this question you will work with a hash table that uses double hashing. The hash table is size 11, the primary hash function is h(K)-K mod 11, and the secondary hash function is hp(K)-(K mod9) +1 Take an empty hash table. Take your student number and split it into 4 2-digit integers. Insert each of these 2-digit numbers in the order in which they appear in your student number into the empty heap. Then insert the values 100, 114, 121, 128 and 135. For your solution, write out the array that stores the hash table Example If your student number was 40260833, your solution would look something like the following (with - representing an empty hash table slot) 033 1 100 4: 26 5 121 6 135 7:40 8:8 10 128

Answer 1

considuStudont num 40 51 62 33 135 Trital hash tab 12 34 S 8 dnse 40 5

51 C b 2 2 Mo 62

6 2 331bo 51 2. 562. 0 coit Mo 33 o0 ん( 1282二 128 mod 11 ニュ(cott

51 62 33|loo 40 2 12 8 I 2 3 4 13s mod 3 colhm hiCL l2-8 d112 S1 | 114 | 621 135 33 loo

0 :33

1:100

2:--

3:51

4:114

5: 62

6:135

7:40

8:121

9:--

10:128