Register
Dark Mode

#madeeasy

in Algorithms
185 views
0 votes
0 votes
Consider a hash table using uniform hashing with number of slots as m = 6 and number of keys, k = 8. Collisions resolved by chaining. Assuming direct hashing is used. The expected number of slots that ends not being empty is _________ (upto 2 decimal point).
in Algorithms
by
185 views

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 vote
1 vote
0 answers
2
shefali1 asked in Algorithms Dec 28, 2017
357 views
#madeeasy test series
shefali1 asked in Algorithms Dec 28, 2017
by shefali1
357 views
0 votes
0 votes
0 answers
3
shefali1 asked in Algorithms Dec 28, 2017
207 views
#madeeasy
shefali1 asked in Algorithms Dec 28, 2017
by shefali1
207 views
1 vote
1 vote
0 answers
4
shefali1 asked in Algorithms Dec 28, 2017
140 views
#madeeasy test series
shefali1 asked in Algorithms Dec 28, 2017
by shefali1
140 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!