Do the following insert and delete operations using linear probing method on an empty hash table...

 

Transcribed Image Text:

Do the following insert and delete operations using linear probing method on an empty hash table with the size of 11. Then, find the average probing number on this hash table. SHOW your steps. Hash function:H(key)=key mod 11 Operations in the following order; insert 6, insert 9, insert 17, insert 28, insert 8, delete 17, insert 39, insert 7, delete 28 Question 4(25p) a) Is the following array of values carry the max heap property. Explain your answer. (Index 0 is intentionally left blank) 9 8 7 5 2 1 6 5 3 1 b) Write a method that takes and integer array and checks whether that array carry max heap property. Assume that first index is left blank intentionally. Do the following insert and delete operations using linear probing method on an empty hash table with the size of 11. Then, find the average probing number on this hash table. SHOW your steps. Hash function:H(key)=key mod 11 Operations in the following order; insert 6, insert 9, insert 17, insert 28, insert 8, delete 17, insert 39, insert 7, delete 28 Question 4(25p) a) Is the following array of values carry the max heap property. Explain your answer. (Index 0 is intentionally left blank) 9 8 7 5 2 1 6 5 3 1 b) Write a method that takes and integer array and checks whether that array carry max heap property. Assume that first index is left blank intentionally.