Register

Made Easy programming and DS

604 views
0 0 votes
What is the expected number of probes for an unsuccessful search for an open address hash table with 10000 slots containing 9800 entries?

a)4

b)10

c)20

d)50

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · https://www.geeksfor...Next → · Miss Penalty
← Previous in category · Made Easy test serie...Next in category → · self-doubt
Position:
Show:

Related questions

2 2 votes
4 4 answers
6.7k
6.7k views
srestha asked Apr 24, 2019
6,708 views
Made Easy Test Series:Programming and DS
Which of the following data structure is efficient to implement priority queue such as insertion ,deletion, searching?A)Linked ListB)HeapC)Sorted ArrayD)Unsorted ArrayHow...
1 1 vote
0 0 answers
350
350 views
Sambhrant Maurya asked Jul 25, 2018
350 views
Made Easy Programming and DS
0 0 votes
0 0 answers
450
450 views
Sambhrant Maurya asked Jul 24, 2018
450 views
Made Easy Programming and DS
What is the maximum height of a binary tree of order p consisting of n keys?a) logp/2(n+1)/2b)log pnc)log p/2 n+1d) None of these
0 0 votes
0 0 answers
302
302 views
Sambhrant Maurya asked Jul 24, 2018
302 views
Made Easy Programming and DS
What is the expected number of probes for an unsuccessful search for an open address hash table with 10000 slots containing 9800 entries?a)4b)10c)20d)50