GATE CSE
First time here? Checkout the FAQ!
x
0 votes
31 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 (11.7k points)  
closed by | 31 views

Related questions

0 votes
1 answer
1
asked in Algorithms by rahul sharma 5 Active (2.5k points)   | 58 views
0 votes
2 answers
2
asked in Algorithms by Desert_Warrior Boss (8.6k points)   | 89 views
0 votes
0 answers
3
asked in Algorithms by vaishali jhalani Boss (5.3k points)   | 35 views
Top Users Jan 2017
  1. Debashish Deka

    8126 Points

  2. sudsho

    5042 Points

  3. Habibkhan

    4706 Points

  4. Vijay Thakur

    4458 Points

  5. Bikram

    4348 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4010 Points

  8. santhoshdevulapally

    3722 Points

  9. GateSet

    3292 Points

  10. Sushant Gokhale

    3286 Points

Monthly Topper: Rs. 500 gift card

19,122 questions
24,034 answers
52,724 comments
20,276 users