Hash Table Implementation with Open Addressing and Size 9, Exams of Internet and Information Access

An example of a hash table with open addressing and a size of 9. The use of the hash function 'k%9' and the insertion of keys 5, 29, 20, 0, 27, 18 in that order. The resulting distribution of keys in the hash table is also shown.

Typology: Exams

2019/2020

Uploaded on 10/02/2021

lewis-munuhe
lewis-munuhe 🇰🇪

3 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Draw a hash table with open addressing and a size of 9. Use the
hash function "k%9", insert the keys: 5, 29, 20, 0, 27, 18 into your
table(in that order).Â
Best Answer
List [0] contains the keys 18 and 0. List [1] is empty. List [2] contains keys 20 and
29. List [3] is empty. List [4] is empty. List [5] contains the key 5. List [6] is
empty. List [7] is empty. List [8] is empty. List [9] is empty
Answer 1
pf2

Partial preview of the text

Download Hash Table Implementation with Open Addressing and Size 9 and more Exams Internet and Information Access in PDF only on Docsity!

Draw a hash table with open addressing and a size of 9. Use the hash function "k%9", insert the keys: 5, 29, 20, 0, 27, 18 into your table(in that order).Â

Best Answer

List [0] contains the keys 18 and 0. List [1] is empty. List [2] contains keys 20 and

  1. List [3] is empty. List [4] is empty. List [5] contains the key 5. List [6] is empty. List [7] is empty. List [8] is empty. List [9] is empty

Answer 1