Suppose you have a hash table of size 10, with a hash function defined as h(k)=...

 

Transcribed Image Text:

Suppose you have a hash table of size 10, with a hash function defined as h(k)= k % 10 This hash table only stores positive integers has all of its buckets initialized to -1. We want to insert the values 6, 33, 10, 28, 19, 51, 48, 12, in the order given. Show the state of the hash table if it is implemented as a closed hash table using linear probing. 0 1 2 3 4 Referring to the closed hash table implementation above. Discuss the potential issues with removing the key 28. Note that you are not asked to fix anything, just comment on the issue. Edit View Insert Format Tools Table 12pt Paragraph BIU A 2 T²V: Suppose you have a hash table of size 10, with a hash function defined as h(k)= k % 10 This hash table only stores positive integers has all of its buckets initialized to -1. We want to insert the values 6, 33, 10, 28, 19, 51, 48, 12, in the order given. Show the state of the hash table if it is implemented as a closed hash table using linear probing. 0 1 2 3 4 Referring to the closed hash table implementation above. Discuss the potential issues with removing the key 28. Note that you are not asked to fix anything, just comment on the issue. Edit View Insert Format Tools Table 12pt Paragraph BIU A 2 T²V: