GATE CSE
First time here? Checkout the FAQ!
x
0 votes
51 views
Consider a hash table using uniform hashing with number of slots as m=6 and number of keys, k=8. collissions resolved by chaining.
Assuming direct hashing is used. the expected number of slots that ends not being empty is __________

Ans: 4.604
closed as a duplicate of: Hashing
asked in Algorithms by Veteran (14.4k points)  
closed by | 51 views

Related questions

0 votes
1 answer
1
asked in Algorithms by rahul sharma 5 Loyal (3.1k points)   | 65 views
0 votes
2 answers
2
asked in Algorithms by Desert_Warrior Boss (8.7k points)   | 91 views
0 votes
0 answers
3
asked in Algorithms by vaishali jhalani Boss (6k points)   | 36 views
Top Users Feb 2017
  1. Arjun

    4704 Points

  2. Bikram

    4004 Points

  3. Habibkhan

    3738 Points

  4. Aboveallplayer

    2966 Points

  5. sriv_shubham

    2278 Points

  6. Smriti012

    2212 Points

  7. Arnabi

    1814 Points

  8. Debashish Deka

    1788 Points

  9. sh!va

    1444 Points

  10. mcjoshi

    1444 Points

Monthly Topper: Rs. 500 gift card

20,788 questions
25,938 answers
59,535 comments
21,929 users