8. For a) and b) below, insert the following elements in this order: 70, 21, 49,
ID: 3713660 • Letter: 8
Question
8. For a) and b) below, insert the following elements in this order: 70, 21, 49, 60, 59, 39. For each table, TableSize 10, and you should use the primary hash function h(k) k0610. If an item cannot be inserted into the table, please indicate this and continue inserting the remaining values Quadratie probing hash table b) Separate chaining hash table-se a linked list for each bucket where the a) values are ordered by increasing value AD 1.9 a) What is the load factor in Table b)? b) What is the worst case running time of a find operation in table b?Explanation / Answer
and in the same way...
In table b using chaining
0
60 is stored in linked list attached to cell 0 and 59 and 39 are stored in link list attached with cell 9.
Here load factor of table b is 1 .
Worst case running time for table b is O (square of n)
0 70 1 21 9 49 4 60Related Questions
Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.