made easy test series

chandra sai asked Nov 18, 2017

231 views

See all

Please log in or register to answer this question.

Related questions

7 votes

4 answers

srestha asked May 5, 2019

5,065 views

Made Easy Test Series: DS-Hash Table
Consider a hash table with $N$ slots. It is given that the collision resolution technique used in chaining. Assume simple uniform hashing, what is the probability that the last $k$ slots are unfilled after the first $'r'$ insertions? $A)\left ( 1-\frac{N}{k} \right )^{r}$ ... $C)\left ( 1+\frac{N}{k} \right )^{r-1}$ $D)\left ( 1-\frac{k}{N} \right )^{r-1}$

Consider a hash table with $N$ slots. It is given that the collision resolution technique used in chaining. Assume simple uniform hashing, what is the probability that th...

srestha

5.1k views

srestha asked May 5, 2019

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

4 votes

0 answers

Akash Mishra asked Jan 18, 2018

1,150 views

Made Easy Full Test - Hashing + Probability
Question - Consider a hash table with 8 slots that use chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted, at least a chain of size 3 is created? (assume simple uniform hashing is used) Correct answer - $29*8^{^{-3}}$ My answer - $8*8^{^{-3}}$

Question - Consider a hash table with 8 slots that use chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inse...

Akash Mishra

1.2k views

Akash Mishra asked Jan 18, 2018

4 votes

2 answers

User007 asked Jan 16, 2017

828 views

MADE EASY TEST SERIES
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we used simple uniform hashing?

Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’.What is the expected number of colliding pairs of elements...

User007

828 views

User007 asked Jan 16, 2017

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

made easy test series

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0