recategorized by
534 views

2 Answers

0 votes
0 votes

Yes, this statement is true

https://webdocs.cs.ualberta.ca/~holte/T26/open-addr.html

Sometimes when a clash occurs, some probing technique may be used to insert the keys. The same probing technique should be used to retrieve too, only then we would find the desired key. 

0 votes
0 votes
in case of no deletion...

no. of probes to insert is equal to no. of probes to retrieve

 

what if deletion occurs..

generally we mark slots that are deleted and occupied before..

so retrieval do not stop at deleted marked slots..

stops only is slot is emoty and not marked as deleted..

so even if deletion occurs no. of probes to retrieve is same as inserting

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
0 answers
2
charul asked Oct 30, 2017
698 views
https://gateoverflow.in/?qa=blob&qa_blobid=11318007552752576944Answer given is : 40/121
2 votes
2 votes
0 answers
3
sushmita asked Mar 26, 2017
433 views
what is the expected number of probs required when inserting an element into an open address hash table with load factor alpha(a), assume uniform hashing??
0 votes
0 votes
1 answer
4
Ram Swaroop asked Jan 27, 2019
1,261 views
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search...