Recent questions tagged double-hashing

3 votes

2 answers

UGC NET CSE | June 2019 | Part 2 | Question: 66
Consider double hashing of the form $h(k,i)=(h_1(k)+ih_2(k)) \text{mod m}$ where $h_{1}(k) = \text{k mod m} \ , \ \ h_{2}(k)=1+(\text{k mod n})$ where $n=m-1$ and $m=701$. For $k=123456$, what is the difference between first and second probes in terms of slots? $255$ $256$ $257$ $258$

Consider double hashing of the form$h(k,i)=(h_1(k)+ih_2(k)) \text{mod m}$ where $h_{1}(k) = \text{k mod m} \ , \ \ h_{2}(k)=1+(\text{k mod n})$ where $n=m-1$ and $m=701$....

Arjun

4.0k views

Arjun asked Jul 2, 2019

0 votes

1 answer

solve this Q
Common Data Questions 30 and 31. Consider the given below following conditions: The size of the hash table is 11. Open addressing and double hashing is used to resolve collisions. The hash function used is H(k) = kmod 11 The second hash function is H2(k) = 5 - ( ... 34, 12, 56 56 stored at which location in the hash table Option (A) 6 Option (B) 8 Option (C) 10 Option (D) 11

Common Data Questions 30 and 31.Consider the given below following conditions:• The size of the hash table is 11.• Open addressing and double hashing is used to resol...

kallu singh

1.6k views

kallu singh asked Sep 7, 2018

To see more, click for the full list of questions or popular tags.

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