Assume that we have a hash table with size m = 13 and the hash function...

Transcribed Image Text:

Assume that we have a hash table with size m = 13 and the hash function h(k)=k%13. We use linear probing to address collisions. Answer the following questions. - (i). [7 marks] Given an empty hash table, show the hash table when inserting 7, 4, 20, 13, 2, 5, 34 in order step by step. 1 - (ii). [8 marks] Given the following hash table, show the records examined when searching for 23. 0 0 16 4 30 18 8 22 10 24 12 25 Assume that we have a hash table with size m = 13 and the hash function h(k)=k%13. We use linear probing to address collisions. Answer the following questions. - (i). [7 marks] Given an empty hash table, show the hash table when inserting 7, 4, 20, 13, 2, 5, 34 in order step by step. 1 - (ii). [8 marks] Given the following hash table, show the records examined when searching for 23. 0 0 16 4 30 18 8 22 10 24 12 25

Answer rating: 100% (QA)

a hash table with size m 13 and the hash function hk k 13The question asks to show the records examined when searching for 23 in the given hash table ... View the full answer