Recent questions tagged hashing / GATE Overflow for GATE CSE

1 votes

1 answer

1

GATE DS&AI 2024 | Question: 11
Consider performing uniform hashing on an open address hash table with load factor $\alpha=\frac{n}{m}<1$, where $n$ elements are stored in the table with $m$ slots. The expected number of probes in an unsuccessful search is at most $\frac{1}{1-\alpha}$. Inserting ... $\frac{1}{1-\alpha}$ $1+\frac{\alpha}{2}$ $\frac{1}{1+\alpha}$

Consider performing uniform hashing on an open address hash table with load factor $\alpha=\frac{n}{m}<1$, where $n$ elements are stored in the table wi...

Arjun

810 views

Arjun asked Feb 16

0 votes

0 answers

2

Memory Based GATE DA 2024 | Question: 54
Hashing question: Given alpha asking for the expected no of probes. Consider the average time complexity in an unsuccessful search for open-addressing hashing with linear probing. If $ \alpha $ represents the load factor, which expression accurately represents the average time complexity ... 1 + \alpha}\right) \) $ 1 + \alpha $ $1 + \frac{ \alpha}{2} $

Hashing question: Given alpha asking for the expected no of probes.Consider the average time complexity in an unsuccessful search for open-addressing hashing with linear ...

GO Classes

234 views

GO Classes asked Feb 4

2 votes

1 answer

3

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 25
A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$ ... that apply. $34,42,23,52,33,46$ $46,34,42,23,52,33$ $42,46,33,23,34,52$ $42,23,34,52,46,33$

A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$. After inserting six integer keys into an initially empty hash table, the array of key...

GO Classes

405 views

GO Classes asked Jan 13

0 votes

1 answer

4

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

355 views

tishhaagrawal asked Dec 16, 2023

0 votes

1 answer

5

Made Easy Test Series 2024
Numerical Answer Type Que? (please Try to give some ahortcut trick also or important concept is there to solve that question )

Numerical Answer Type Que?(please Try to give some ahortcut trick also or important concept is there to solve that question )

Ray Tomlinson

515 views

Ray Tomlinson asked Aug 9, 2023

0 votes

1 answer

6

UGC NET CSE | June 2023 | Part 2: 9
Consider a hash table of size seven with starting index zero and a hash function $(6 x+3) \bmod 4$. Assuming the hash table is initially empty. Which of the following is the content of the table when the sequence $1,3,8,10,5$, is inserted into the table using closed hashing? Here " denotes ... $3,8,1,$_,$10,5$ _,$3,8,1$,_,$10,5$ _$1,3,8,10,5$,_

Consider a hash table of size seven with starting index zero and a hash function $(6 x+3) \bmod 4$. Assuming the hash table is initially empty. Which of the following is ...

admin

710 views

admin asked Jul 28, 2023

0 votes

1 answer

7

Kotidis I., First Exercise Pack 2021-2022.
Consider an extendible hash index, each bucket of which holds N entries. What is the probability that an overflowed bucket needs to be dealt with recursively? “Dealt with recursively” means that all of this bucket’s records are moved to one of the two new buckets that will be created.

Consider an extendible hash index, each bucket of which holds N entries. What is the probability that an overflowed bucket needs to be dealt with recursively? “Dealt wi...

juli

310 views

juli asked Apr 2, 2023

2 votes

4 answers

8

GO Classes 2023 | IIITH Mock Test 1 | Question: 16
Consider a hash table of $9$ slots implemented with linear probing. Suppose we insert $2$ elements in a sequence to a hash table with a simple uniform hashing assumption. What is the probability that we end up with $2$ consecutive slots of the hash table filled? ... $1/2$ $1/3$ $1/4$ $2/3$

Consider a hash table of $9$ slots implemented with linear probing. Suppose we insert $2$ elements in a sequence to a hash table with a simple uniform hashing assumption....

GO Classes

952 views

GO Classes asked Mar 26, 2023

11 votes

3 answers

9

GATE CSE 2023 | Question: 10
An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let $k$ be the number of keys, $m$ be the number of slots in the hash ... a carefully chosen constant. Universal hashing method. If $k$ is a prime number, use Division method. Otherwise, use Multiplication method.

An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let $k$ be th...

admin

9.6k views

admin asked Feb 15, 2023

3 votes

1 answer

10

DRDO CSE 2022 Paper 2 | Question: 22
A hash table contains $10$ buckets and uses linear probing to resolve collisions. The key values are intergers and the hash function used is $\text{Key}\%10.$ If we insert values $43,165,62,123,152$ sequentially in the table, in what bucket will the key $152$ be inserted?

A hash table contains $10$ buckets and uses linear probing to resolve collisions. The key values are intergers and the hash function used is $\text{Key}\%10.$ If we inser...

admin

557 views

admin asked Dec 15, 2022

0 votes

1 answer

11

Data structures and algorithms
Consider the last four digits of your register number and form the following numbers: 1. first digit 2. second digit 3. third digit 4. fourth digit 5. 2 digit number with the first two digits 6. 2 digit number with the last two digits ... inserted into a hash table whose description is given above and the contents of the table after insertion are to be clearly given.

Consider the last four digits of your register number and form the following numbers:1. first digit2. second digit3. third digit4. fourth digit5. 2 digit number with the ...

Karthi2003

496 views

Karthi2003 asked Nov 7, 2022

1 votes

0 answers

12

Ace Academy Test Series Qn#7
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64

A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...

Souvik33

405 views

Souvik33 asked Oct 30, 2022

0 votes

0 answers

13

Ace Academy Test Series
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64

A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...

Souvik33

336 views

Souvik33 asked Oct 30, 2022

0 votes

0 answers

14

Best Open Video Playlist for Hashing Topic | Algorithm
Please list out the best free available video playlist for Hashing from Algorithm as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom video lists. You can add any video ... but standard ones are more likely to be selected as best. For the full list of selected videos please see here

Please list out the best free available video playlist for Hashing from Algorithm as an answer here (only one playlist per answer). We'll then select the best playlist an...

makhdoom ghaya

251 views

makhdoom ghaya asked Aug 17, 2022

0 votes

2 answers

15

Madeeasy Test Series
A hash table of size 10 using open addressing with linear probing and hash function is h(k)= (k)mod10 , where k is key value , initially table is empty . Following keys are inserted into table in given order . 44,87,43,68,30,20,67 How many number of probes required to insert 17 in table after inserting above keys?

A hash table of size 10 using open addressing with linear probing and hash function is h(k)= (k)mod10 , where k is key value , initially table is empty . Following keys a...

Manisha Jaishwal

992 views

Manisha Jaishwal asked Jul 25, 2022

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