GATE CSE
First time here? Checkout the FAQ!
x
0 votes
63 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 | 63 views

Related questions

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


Top Users May 2017
  1. akash.dinkar12

    3578 Points

  2. pawan kumarln

    2314 Points

  3. Bikram

    1950 Points

  4. Arjun

    1852 Points

  5. sh!va

    1682 Points

  6. Debashish Deka

    1296 Points

  7. Devshree Dubey

    1282 Points

  8. Arunav Khare

    1122 Points

  9. Angkit

    1072 Points

  10. LeenSharma

    1028 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 29 - Jun 04
  1. Arunav Khare

    246 Points

  2. Arjun

    202 Points

  3. pawan kumarln

    108 Points

  4. Rupendra Choudhary

    94 Points

  5. Niharika 1

    90 Points


22,909 questions
29,243 answers
65,403 comments
27,745 users