Question

please help fast, this is for practice

will not upvote if you take too long

For the input 49, 20, 56, 75, 89, 87, 65 and hash function h(k)=k mod 11, construct the closed hash table using linear probing.

Answer 1

Hash Table :

It is a data Structure which stores the data in Associated manner based on the Index value generated by the Hash function(It is a mathematical function which returns any index position in the Hash table).

If the index position generated by the Hash Function is already occupied with some other then it is called Collision Then we follow some collision resolution techniques like linear probing

Linear Probing: It is one of the collision resolution technique in which we place the value in the next Empty position of the Hash table whenever a Collision Occurs.

Given Input Keys: 49,20,56,75,89,87,65

Hash Function: k mod 11 (key_value %11)
Collision Resolution: Linear Probing

Step 1: Inserting 49

• Hash position = 49 % 11 = 5
• Attempting to insert 49 at position 5.(Empty)
• Inserting 49 at position 5.

0 3 5 49 6 7 2 9 10

Step 2: Inserting 20

• Hash position = 20 % 11 = 9
• Attempting to insert 20 at position 9.(Empty)
• Inserting 20 at position 9.

0 نيا 5 49 8 9 20 10

Step 3: Inserting 56

• Hash position = 56 % 11 = 1
• Attempting to insert 56 at position 1.(Empty)
• Inserting 56 at position 1.

0 56 1 2 3 4 5 49 6 7 8 9 20 10

Step 4: Inserting 75

• Hash position = 75 % 11 = 9
• Attempting to insert 75 at position 9.(occupied So Collision)
• Attempting to insert 75 at next adjacent position 10.(Empty)
• Inserting 75 at position 10.

0 1 1 56 2 نيا 49 8 9 10

Step 5: Inserting 89

• Hash position = 89 % 11 = 1
• Attempting to insert 89 at position 1.(occupied So Collision)
• Attempting to insert 89 at next adjacent position 2.(Empty)
• Inserting 89 at position 2

0 1 56 2 89 3 4 ת) 49 6 ן 8 9 20 10 75

Step 6: Inserting 87

• Hash position = 87 % 11 = 10
• Attempting to insert 87 at position 10.(occupied So Collision)
• Attempting to insert 87 at next adjacent position 0.(Empty)
• Inserting 87 at position 0

0 8 3 4 5 49 9 10

Step 7: Inserting 65

• Hash position = 65 % 11 = 10
• Attempting to insert 65 at position 10.(occupied So Collision)
• Attempting to insert 65 at next adjacent position 0.(occupied So Collision)
• Attempting to insert 65 at next adjacent position 1.(occupied So Collision)
• Attempting to insert 65 at next adjacent position 2.(occupied So Collision)
• Attempting to insert 65 at next adjacent position 3.(Empty)
• Inserting 65 at position 3

.

0 27 1 56 2 89 3 ס 4 ת) 49 6 1 8 9 20 10 75

This final Hash table after all 7 insertions into table.

If You Have Any Doubts. Please Ask Using Comments.

Have A Great Day!