Register

hashing

• retagged by
423 views
2 votes
2 votes

The keys 25, 6, 37, 79, 51, 13 and 31 are inserted into an initially empty hash table of length 7 using open addressing with hash function h(k)=k mod 7 and linear probing. What is the number of collision if linear probing is used to resolve the collision?

  1. 8
  2. 9
  3. 11
  4. 10
• retagged by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
2
GO Classes asked Jan 13
405 views
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 25
A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$ ... that apply. $34,42,23,52,33,46$ $46,34,42,23,52,33$ $42,46,33,23,34,52$ $42,23,34,52,46,33$
A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$. After inserting six integer keys into an initially empty hash table, the array of key...
User Avatar
0 votes
0 votes
1 answer
3
Ray Tomlinson asked Aug 9, 2023
515 views
Made Easy Test Series 2024
Numerical Answer Type Que? (please Try to give some ahortcut trick also or important concept is there to solve that question )
Numerical Answer Type Que?(please Try to give some ahortcut trick also or important concept is there to solve that question )
User Avatar
Link Copied!