Use the shapes in PowerPoint to draw the steps of executing the following set of operations on a hash table implemented with open addressing and probing. For each operation, draw the result of the table and indicate a collision and where the next probe occurs using arrows.
- Using linear probing with a table of size 13, make the following changes: add key 12; add key 13; add key 26; add key 6; add key 14, remove 26, add 39.
- Using quadratic probing with a table of size 13, make the following changes: add key 12; add key 13; add key 26; add key 6; add key 14, remove 26, add 39.
- Using double hashing with a table of size 13, make the following changes: add key 12; add key 13; add key 26; add key 6; add key 14, remove 26, add 39.
I have included an example PPT.

Leave a Reply
You must be logged in to post a comment.