** Please help me out, I\'m trying to study for my final and this question is a

Question

** Please help me out, I'm trying to study for my final and this question is a practice example to prepare myself for the final **

Part A. Show the results of inserting the following keys into the empty 9-bucket hash table shown below that uses chaining. The keys are shown along with the their hash codes. Do the insertions in the order the keys are shown (a-f Key hash code a. Ashley 5 b. Joe c. Ted d. Dana. e. Sam f, Sara. Part B. For each of the following lookups from the table resulting from part A, give the sequence of keys that the target key would have to be compared with to do the l or say "none" ifit doesn't need to be compared to any keys i. lookup Ted. Ted hashes to 3 i. look up Anna; Anna hashes to 8 iii. lookup Bob: Bob hashes to 4

Explanation / Answer

it print 1->2->3->1->2->3->1->2->3-> and so on. its a circular Link list

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.