Question

#1 [8 points) Sketch a hash table of size N=11, where the hash function is hash(key) = key mod N and chaining is used to resolve collisions, when the following elements are inserted: 20, 42, 45, 49, 62, 72,95 0 1 2 3 4 5 6 7 8 9 10 What is the size of the largest bucket? — #2 [7 points) Sketch a hash table of size N=11, where the hash function is hash(key) = key mod N and linear probing is used to resolve collisions, when the following elements are inserted: 20, 42, 45, 49, 62, 72,95 0 1 2 3 4 5 6 7 8 9 10 #3 [7 points) Sketch a hash table of size N=7, where the hash function is hash(key) = key mod N and linear probing is used to resolve collisions, when the following elements are inserted: 20, 42, 45, 72,95 0 1 2 3 4 5 6 Resize the table when the load factor is 2 0.6. Note that N will change (Hint: the first few prime numbers are 2,3,5,7,11,13,17,19,23). Sketch the new hash table, where the hash function is hash(key) - key mod N and linear probing is used to resolve collisions when the elements are inserted again in the new table.

It should be really short and simple to do this.

Answer 1

1 20,42,45,49,62,72,95 and N. hikey) - Key mod N o h (20) = 20 mod 11=9 h242) = 42 modul 9 -> collision occur maintain separate chain. h(45) = 45 mod 11 = 1 hcua) = 49 mod l = 5 h(62) = 62 modl1 = 7 h (72) = 72 mod 11 = 6 has) = 95 mod 11 - 7 = collision occur maintain separ -ate chain >72) 7 62 895) largest bucket is 2. The size of the

then insert the key 45 Linear probing :- If the collision occur in next position. hekey) = key modN. hc20) = 20 mod 1129 he42) = 42 modlica collision occurr so insert at next position de 10 h45) = 45 mod 1151 h19) 249 mod 11 = 5 h(62) = 62 modll 27 Odmose it coon 62 95 20 42 h (72) = 72 mod 11 = 6 h (95)-95 modll7 ansert at next position that is g. According to HomeworkLib guidelines i have to solve first question only. But i solve first 2. please do next post for remaining answers.