Let H be a hash table of size 7 with the hash function h(K) = 4*k mod 7 implemen

Question

Let H be a hash table of size 7 with the hash function h(K) = 4*k mod 7 implemented using CHAINED hashing. Consider the following sequence of insert operations: Draw the hash table after all the above operations have been executed, showing which data elements are in which locations of the hash table and how they arc stored. Show your work. Let H be a hash table of size 7 with the hash function h(K, j) = (4*k + 5*j) mod 7 implemented using OPEN ADDRESS hashing. Assume that H[0], H[3], H[5] and H[6] are already filled in the hash table so that the hash table looks like: Consider the following sequence of insert operations: Draw the hash table after all the above operations have been executed, showing which data elements are in which locations of the hash table.

Explanation / Answer

3. given that h(K)= 4*k mod 7.

Insert(5,D5):

H(5)=4*5 mod 7= 6

Insert(10,D10):

H(12)=4*10 mod 7=5

Insert(12,D12):

H(12)=4*12 mod 7= 6

Insert(15,D15):

H(15)=4*15 mod 7= 4

Insert(4,D4):

H(4)=4*4 mod 7= 2

Insert(40,D40):

H(40)=4*40 mod 7= 6

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

---

---

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