Register

Virtual Gate Test Series: Algorithms - Hash Table

• retagged by
860 views

1 Answer

0 0 votes
worst case will occur when the element being searched is hashed to 8 so it will search for 8,9,0,1,2,3 and 4 when it sees that 4 is empty it stops the search so that is the worst case for the above arrangement
Voting & Accepting an answer helps improve the community
← Previous · Carry lookahead adde...Next → · VG 2016
← Previous in category · # algorithmNext in category → · doubt
Position:
Show:

Related questions

60 60 votes
4 answers 4 answers
25.1k
25.1k views
Arjun asked Feb 12, 2020
25,087 views
GATE CSE 2020 | Question: 23
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Ass...
1 1 vote
2 answers 2 answers
948
948 views
Mk Utkarsh asked Nov 11, 2017
948 views
Virtual Gate Test Series: Algorithms - Hash Table(Linear Probing)
2 2 votes
1 1 answer
1.8k
1.8k views
Hradesh patel asked Oct 1, 2016
1,811 views
Virtual Gate Test Series: Algorithms - Hashing With Chaining
Let $| U | = m^{2}$ and consider hashing with chaining. For any hash function $h : U\rightarrow{ 1, 2, ......., m-1}, $ there exists a sequence of $m$ insertions that lea...
1 1 vote
1 1 answer
1.5k
1.5k views
neerajyadav asked Dec 4, 2018
1,479 views
doubt regarding NUMBER OF INSERTION SEQUENCES IN HASH TABLE