Insert the keys 4, 9, 20, 35, and 49 in a chained hash table of 10 memory locations. Use hash function h(k) = k mod m.

Question

Accepted Answer

Initially, the hash table is given as:

Now, we will insert 4 in the hash table.

Step 1:

Key to be inserted = 4
h(4) = 4 mod 10
h(4) = 4
Now, we will create a linked list for location 4, and the key element 4 is stored in it.

Step 2:
Key to be inserted = 9
h(9) = 9 mod 10
h(9) = 9
Now, we will create a linked list for location 9, and the key element 9 is stored in it.

Step 3:
Key to be inserted = 20
h(20) = 20 mod 10
h(20) = 2
Now, we will create a linked list for location 2, and the key element 20 is stored in it.

Step 4:
Key to be inserted = 35
h(35) = 35 mod 10
h(35) = 5
Now, we will create a linked list for location 5, and the key element 35 is stored in it.

Step 5:
Key to be inserted = 49
h(49) = 49 mod 10
h(49) = 9
Now, we will insert 49 at the end of the linked list of location 9.

Question 10.FAQ.5: Insert the keys 4, 9, 20, 35, and 49 in a chained hash table...

Related Answered Questions

Given keys k = 71, 29, 38, 61, and 100, map these keys into a hash table of size m = 5 using double hashing. Take h1 = (k mod 5)and h2 = (k mod 4). ...

Verified Answer:

Given keys k = 13, 25, 14, and 35, map these keys into a hash table of size m = 5 using linear probing. ...

Verified Answer:

Given keys k = 25, 13, 14, and 35, map these keys into a hash table of size m = 5 using quadratic probing with c1 = 1 and c2 = 3. ...

Verified Answer:

Given a hash table of 100 memory locations, calculate the hash values of keys 2486 and 179 using the folding method. ...

Verified Answer:

Given a hash table of 100 memory locations, calculate the hash values of keys 2045 and 1357 using the mid square method. ...

Verified Answer:

Explain the term hashing. ...

Verified Answer:

Given a hash table of 50 memory locations, calculate the hash values of keys 20 and 75 using the division method. ...

Verified Answer: