hashing
closed

pranab ray asked Jan 15, 2018 • closed Jan 15, 2018 by Anu007

213 views

See all

Related questions

0 votes

1 answer

tishhaagrawal asked Dec 16, 2023

360 views

Made Easy Test Series : Consider an open addressing hashing scheme with m slots and n keys. Assuming uniform hashing, the expected number of empty slots in the hash table for m=7 and n=3 is equal to ____________(Round off to two decimal places)

Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...

tishhaagrawal

360 views

tishhaagrawal asked Dec 16, 2023

1 votes

1 answer

MiNiPanda asked Jan 1, 2019

922 views

MadeEasy Test Series: Programming & DS - Hashing
Consider the hashing table with m' slots and n' keys. If the expected number of probes in an unsuccessful search is 3, the expected number of probes in successful search is _____(Up to 2 decimals) Ans. 1.647 Here by default ... given here in the table http://cs360.cs.ua.edu/notes/hashing_formulas.pdf With linear hashing, I am getting around 1.61

Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in an unsuccessful search is 3, the expected number of probes in success...

MiNiPanda

922 views

MiNiPanda asked Jan 1, 2019

10 votes

1 answer

Ayush Upadhyaya asked Sep 22, 2018

3,351 views

Hashing with Linear probing
Consider an initially empty hash table of length 10. Following are the keys in hash table inserted using mod function h(k)=k mod 10. Slot Number Value 0 1 91 2 3 33 4 44 5 23 6 64 7 77 8 9 How many different insertion sequences of keys would result in the above hash table? My answer comes to be 56, is it correct?

Consider an initially empty hash table of length 10. Following are the keys in hash table inserted using mod function h(k)=k mod 10.Slot NumberValue0 1912 333444523664777...

Ayush Upadhyaya

3.4k views

Ayush Upadhyaya asked Sep 22, 2018

3 votes

2 answers

ben10 asked Sep 15, 2018

1,322 views

Hashing

ben10

1.3k views

ben10 asked Sep 15, 2018

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

hashing
closed

Please log in or register to add a comment.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

0 Answers

Related questions

0