Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for hashing
72
votes
4
answers
1
GATE CSE 2015 Set 2 | Question: 33
Which one of the following hash functions on integers will distribute keys most uniformly over $10$ buckets numbered $0$ to $9$ for $i$ ranging from $0$ to $2020$? $h(i) = i^2 \text{mod } 10$ $h(i) = i^3 \text{mod } 10$ $h(i) = (11 \ast i^2) \text{mod } 10$ $h(i) = (12 \ast i^2) \text{mod } 10$
Which one of the following hash functions on integers will distribute keys most uniformly over $10$ buckets numbered $0$ to $9$ for $i$ ranging from $0$ to $2020$?$h(i) ...
go_editor
16.8k
views
go_editor
asked
Feb 12, 2015
DS
gatecse-2015-set2
data-structures
hashing
normal
+
–
73
votes
10
answers
2
GATE CSE 2010 | Question: 53
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ ... of the key values using the same hash function and linear probing will result in the hash table shown above? $10$ $20$ $30$ $40$
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ values into an empty hash table, the...
go_editor
27.0k
views
go_editor
asked
Apr 21, 2016
DS
data-structures
hashing
normal
gatecse-2010
+
–
53
votes
4
answers
3
GATE CSE 1989 | Question: 1-vii, ISRO2015-14
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is $4$ $5$ $6$ $3$
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear p...
Anu
17.7k
views
Anu
asked
Jun 1, 2015
Algorithms
hashing
isro2015
gate1989
algorithms
normal
+
–
62
votes
11
answers
4
GATE IT 2007 | Question: 28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collide...
Ishrat Jahan
29.0k
views
Ishrat Jahan
asked
Oct 29, 2014
DS
gateit-2007
data-structures
hashing
probability
normal
+
–
11
votes
3
answers
5
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.3k
views
admin
asked
Feb 15, 2023
Algorithms
gatecse-2023
algorithms
hashing
1-mark
+
–
19
votes
2
answers
6
GATE CSE 2022 | Question: 6
Suppose we are given $n$ keys, $m$ hash table slots, and two simple uniform hash functions $h_{1}$ and $h_{2}.$ Further suppose our hashing scheme uses $h_{1}$ for the odd keys and $h_{2}$ for the even keys. What is the expected number of keys in a slot? $\frac{m}{n}$ $\frac{n}{m}$ $\frac{2n}{m}$ $\frac{n}{2m}$
Suppose we are given $n$ keys, $m$ hash table slots, and two simple uniform hash functions $h_{1}$ and $h_{2}.$ Further suppose our hashing scheme uses $h_{1}$ f...
Arjun
10.3k
views
Arjun
asked
Feb 15, 2022
Algorithms
gatecse-2022
algorithms
hashing
uniform-hashing
1-mark
+
–
14
votes
3
answers
7
Hash table
A Hash table has space for 100 records. Then the probability of collision before the table is 10% full is? A 0.45 B 0.5 C 0.3 D 0.34 (approximately)
A Hash table has space for 100 records. Then the probability of collision before the table is 10% full is?A 0.45B 0.5C 0.3D 0.34 (approximately)
Soumyashree
15.4k
views
Soumyashree
asked
Nov 21, 2015
Algorithms
hashing
probability
+
–
26
votes
3
answers
8
GATE CSE 2007 | Question: 40
Consider a hash table of size seven, with starting index zero, and a hash function $(3x + 4)\mod 7$. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence $1, 3, 8, 10$ is inserted into the table using closed hashing? Note that − denotes an ... $3$ $1$, −, −, −, −, −, $3$ $1, 10, 8$, −, −, −,$ 3$
Consider a hash table of size seven, with starting index zero, and a hash function $(3x + 4)\mod 7$. Assuming the hash table is initially empty, which of the following is...
Kathleen
15.9k
views
Kathleen
asked
Sep 21, 2014
DS
gatecse-2007
data-structures
hashing
easy
+
–
39
votes
6
answers
9
GATE CSE 1996 | Question: 1.13
An advantage of chained hash table (external hashing) over the open addressing scheme is Worst case complexity of search operations is less Space used is less Deletion is easier None of the above
An advantage of chained hash table (external hashing) over the open addressing scheme isWorst case complexity of search operations is lessSpace used is lessDeletion is ea...
Kathleen
13.6k
views
Kathleen
asked
Oct 9, 2014
DS
gate1996
data-structures
hashing
normal
+
–
26
votes
3
answers
10
GATE CSE 1995 | Question: 2.22
Which of the following statements is true? As the number of entries in a hash table increases, the number of collisions increases. Recursive programs are efficient The worst case complexity for Quicksort is $O(n^2)$ Binary search using a linear linked list is efficient I and II II and III I and IV I and III
Which of the following statements is true?As the number of entries in a hash table increases, the number of collisions increases.Recursive programs are efficientThe worst...
Kathleen
11.3k
views
Kathleen
asked
Oct 8, 2014
DS
gate1995
data-structures
linked-list
hashing
+
–
24
votes
5
answers
11
GATE CSE 2004 | Question: 7
Given the following input $(4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199)$ and the hash function $x$ mod $10$, which of the following statements are true? $9679, 1989, 4199$ hash to the same value $1471, 6171$ hash to the same value All elements hash to the same value Each element hashes to a different value I only II only I and II only III or IV
Given the following input $(4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199)$ and the hash function $x$ mod $10$, which of the following statements are true?$9679, 1989, 4...
Kathleen
9.8k
views
Kathleen
asked
Sep 18, 2014
DS
gatecse-2004
data-structures
hashing
easy
+
–
0
votes
1
answer
12
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
696
views
Arjun
asked
Feb 16
DS
gate-ds-ai-2024
data-structures
hashing
uniform-hashing
+
–
2
votes
0
answers
13
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
348
views
GO Classes
asked
Jan 13
Algorithms
goclasses2024-mockgate-11
goclasses
algorithms
hashing
linear-probing
multiple-selects
1-mark
+
–
0
votes
0
answers
14
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
198
views
GO Classes
asked
Feb 4
Algorithms
gate2024-da-memory-based
goclasses
algorithms
hashing
linear-probing
+
–
1
votes
2
answers
15
Hash table
A hash table can store a max of 10 records, currently, there are records in locations 1,3,4,7,8,9,10. The probability of a new record going into location 2,with a hash function resolving collisions by linear probing is..
A hash table can store a max of 10 records, currently, there are records in locations 1,3,4,7,8,9,10. The probability of a new record going into location 2,with a hash fu...
Soumyashree
9.0k
views
Soumyashree
asked
Nov 21, 2015
Algorithms
hashing
linear-probing
numerical-answers
+
–
0
votes
1
answer
16
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
313
views
tishhaagrawal
asked
Dec 16, 2023
Programming in C
hashing
uniform-hashing
data-structures
doubt
made-easy-test-series
+
–
0
votes
1
answer
17
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
658
views
admin
asked
Jul 28, 2023
DS
ugcnetcse-june2023-paper2
data-structures
hashing
+
–
24
votes
2
answers
18
GATE CSE 2020 | Question: 23
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Assume that the table size is $23$. Then the address returned by probe $1$ in the probe sequence (assume that the probe sequence begins at probe $0$) for key value $k=90$ is_____________.
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Ass...
Arjun
13.7k
views
Arjun
asked
Feb 12, 2020
Algorithms
gatecse-2020
numerical-answers
algorithms
hashing
1-mark
+
–
2
votes
4
answers
19
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
789
views
GO Classes
asked
Mar 26, 2023
Algorithms
goclasses2023-iiith-mock-1
goclasses
algorithms
hashing
linear-probing
1-mark
+
–
0
votes
1
answer
20
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
485
views
Ray Tomlinson
asked
Aug 9, 2023
Algorithms
made-easy-test-series
made-easy-booklet
algorithms
hashing
linear-probing
algorithm-design
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register