Register

MadeEasy Test Series 2018: Programming & DS - Hashing

• edited by
583 views
2 votes
2 votes

• edited by
User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
0 answers
1
Jyoti Kumari97 asked Nov 25, 2018
590 views
MadeEasy Test Series 2018: Programming & DS - Hashing
What is the number of collisions while doing insert operation on the hash table? Options are 3 4 5 6 Answer is 4 Can anyone tell me how? ​​
What is the number of collisions while doing insert operation on the hash table? Options are 3456Answer is 4Can anyone tell me how? ​​
User Avatar
0 votes
0 votes
1 answer
2
Ram Swaroop asked Jan 27, 2019
1,336 views
MadeEasy Test Series 2019: Programming & DS - Hashing
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 is_ Answer 1.647
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...
User Avatar
0 votes
0 votes
1 answer
3
Anusha Motamarri asked Dec 6, 2016
563 views
MadeEasy Test Series: Programming & DS - Hashing
anybody give detailed explnation please
anybody give detailed explnation please
User Avatar
1 votes
1 votes
1 answer
4
Vishal Goyal asked Dec 6, 2016
699 views
MadeEasy Test Series: Programming & DS - Hashing
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we used simple uniform hashing?
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of element...
User Avatar
Link Copied!