The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
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 (16.8k points)
closed by | 135 views

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,831 questions
36,676 answers
34,638 users