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


Top Users Sep 2017
  1. Habibkhan

    6970 Points

  2. Warrior

    2490 Points

  3. Arjun

    2368 Points

  4. rishu_darkshadow

    2136 Points

  5. A_i_$_h

    2004 Points

  6. nikunj

    1980 Points

  7. makhdoom ghaya

    1760 Points

  8. manu00x

    1750 Points

  9. Bikram

    1744 Points

  10. SiddharthMahapatra

    1718 Points


26,060 questions
33,668 answers
79,747 comments
31,079 users