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

Related questions

0 votes
1 answer
1
asked in Algorithms by rahul sharma 5 Loyal (3.1k points)   | 71 views
0 votes
2 answers
2
asked in Algorithms by Desert_Warrior Boss (8.7k points)   | 95 views
0 votes
0 answers
3
asked in Algorithms by vaishali jhalani Boss (6k points)   | 38 views


Top Users Apr 2017
  1. akash.dinkar12

    3508 Points

  2. Divya Bharti

    2542 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Shubham Sharma 2

    1610 Points

  7. Debashish Deka

    1588 Points

  8. Arunav Khare

    1454 Points

  9. Kapil

    1424 Points

  10. Arjun

    1420 Points

Monthly Topper: Rs. 500 gift card

22,076 questions
28,040 answers
63,230 comments
24,135 users