2, Given input {4371, 1325.o1.le !199, 4344, 9679, 19891 and a hash function hox) =x %10 (table size is 10), showing the resu

2, Given input {4371, 1325.o1.le !199, 4344, 9679, 19891 and a hash function hox) =x %10 (table size is 10), showing the resulting (20 pts) Open addressing hash table using linear probing. Open addrcssing hash table using quadratic probing. Open addressing hash table with second hash function h2x) = 7- (x %7) b. c. d. Draw the figurcs to show stcps how to convert the binary trec to a hcapusing the Hcapify algorithm. (10 pts) 3. 4. Using the diagrams (like in handouts12 slides 51-55) to trace the action of heapsort on the list of 1, 7, 2,6, 3. 5,4. give every state of your tree such as finishing a heapify or removing the root. (20 pts)



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *