Please help me out. It is a practice problem for my exam and I\'m trying to see

Question

Please help me out. It is a practice problem for my exam and I'm trying to see if I did it right!! Thanks alot.

Consider a hash table with chaining using an array called ha Suppose we have a key ourkey, whose hash value is 27. (i.e., hash (ourkey) returns 27) Part A (1). Circle the answer that best matches: If hashArray[27] is not empty we know that: i. ourkey is definitely present in the table ii. ourkey may be present in the table iii. ourkey is definitely not present in the table Part B (1). Give an answer from the above choices (i, ii, iii) that best matches for the following If hashArray 1271 is empty we know that: Part C (2). If either of your answers to part A or B was ii, describe the other work is necessary to determine whether ourkey is present in the table. Do not write code, but be specific about what has to happen. (If you answered ii to both parts, give and label two answers, one for each of parts A and B; if you didn't answer ii to either, just say "no additional work necessary")

Explanation / Answer

A. b

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

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