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


Top Users Jul 2017
  1. Bikram

    5784 Points

  2. manu00x

    3602 Points

  3. Arjun

    1988 Points

  4. Debashish Deka

    1924 Points

  5. joshi_nitish

    1908 Points

  6. pawan kumarln

    1680 Points

  7. Tesla!

    1426 Points

  8. Hemant Parihar

    1334 Points

  9. Shubhanshu

    1180 Points

  10. Arnab Bhadra

    1124 Points


24,169 questions
31,187 answers
71,039 comments
29,512 users