Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged hashing
0
votes
0
answers
Applied topic test
" if we assume uniform hashing, what is the probability that a collision will occur in a hash table with 100 buckets and 2 keys?" Doesn't this question means that we have a hash table in which there are already 2 keys, and we have ... probability of collision for the next insertion? Or it is asking the probability of collision in the table for these two keys insertion?
asked
1 day
ago
in
Programming
by
Ankita87077
(
9
points)

11
views
hashing
0
votes
0
answers
SELF DOUBT HASHING
https://gateoverflow.in/57653/cormen2ndeditionexercise1121 WHY WE CANT DO LIKE THIS …...NUMBER OF COLLISIONS(X) : 0 1 2 3 4 …………………...N1 P(X): 0/M 1/M 2/M…………………… … ………….(N1)/M
asked
3 days
ago
in
DS
by
eyeamgj
(
25
points)

8
views
hashing
0
votes
0
answers
Made easy theory book,Self doubt in Hashing Techniques
asked
Sep 5, 2020
in
Programming
by
sarthakdarji
(
9
points)

22
views
madeeasytestseries
datastructures
hashing
0
votes
0
answers
GATE201053 Video Solution
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$
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

6
views
datastructures
hashing
normal
gate2010
videosolution
0
votes
0
answers
GATE19891vii, ISRO201514 Video Solution
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$
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

9
views
hashing
isro2015
gate1989
datastructures
normal
videosolution
0
votes
0
answers
GATE2007IT28 Video Solution
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$
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

12
views
gate2007it
datastructures
hashing
probability
normal
videosolution
0
votes
0
answers
GATE2014340 Video Solution
Consider a hash table with $100$ slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first $3$ slots are unfilled after the first $3$ insertions? $(97 \times 97 \times 97) / 100^3$ $(99 \times 98 \times 97) / 100^3$ $(97 \times 96 \times 95) / 100^3$ $(97 \times 96 \times 95 / (3! \times 100^3)$
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

8
views
gate20143
datastructures
hashing
probability
normal
videosolution
0
votes
0
answers
GATE2015233 Video Solution
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$
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

8
views
gate20152
datastructures
hashing
normal
videosolution
0
votes
0
answers
GATE19961.13 Video Solution
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
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

7
views
gate1996
datastructures
hashing
normal
videosolution
0
votes
0
answers
GATE199712 Video Solution
Consider a hash table with $n$ buckets, where external (overflow) chaining is used to resolve collisions. The hash function is such that the probability that a key value is hashed to a particular bucket is $\frac{1}{n}$. The hash table is initially ... occurred in any of the $K$ insertions? What is the probability that the first collision occurs at the $K^{th}$ insertion?
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

21
views
gate1997
datastructures
hashing
probability
normal
videosolution
0
votes
0
answers
GATE200740 Video Solution
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$
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

5
views
gate2007
datastructures
hashing
easy
videosolution
0
votes
0
answers
GATE19952.22 Video Solution
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
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

36
views
gate1995
datastructures
linkedlists
hashing
videosolution
0
votes
0
answers
GATE2014140 Video Solution
Consider a hash table with $9$ slots. The hash function is $h(k)= k \mod 9$. The collisions are resolved by chaining. The following $9$ keys are inserted in the order: $5, 28, 19, 15, 20, 33, 12, 17, 10$. The maximum, minimum, and average chain lengths in the hash table, respectively, are $3, 0,$ and $1$ $3, 3,$ and $3$ $4, 0,$ and $1$ $3, 0,$ and $2$
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

5
views
gate20141
datastructures
hashing
normal
videosolution
0
votes
0
answers
GATE201052 Video Solution
A hash table of length $10$ uses open addressing with hash function $h(k) = k \mod 10$, and linear probing. After inserting $6$ ... $34, 42, 23, 52, 33, 46$ $46, 34, 42, 23, 52, 33$ $42, 46, 33, 23, 34, 52$
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

7
views
gate2010
datastructures
hashing
normal
videosolution
0
votes
0
answers
GATE199615 Video Solution
Insert the characters of the string $K \ R \ P \ C \ S \ N \ Y \ T \ J \ M$ into a hash table of size $10$. Use the hash function $h(x)=( ord (x) – ord ("a") + 1) \mod 10$ and linear probing to resolve collisions. Which insertions cause collisions? Display the final hash table.
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

6
views
gate1996
datastructures
hashing
normal
videosolution
0
votes
0
answers
GATE2005IT16 Video Solution
A hash table contains $10$ buckets and uses linear probing to resolve collisions. The key values are integers and the hash function used is key % $10$. If the values $43, 165, 62, 123, 142$ are inserted in the table, in what location would the key value $142$ be inserted? $2$ $3$ $4$ $6$
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

7
views
gate2005it
datastructures
hashing
easy
videosolution
0
votes
0
answers
GATE2015317 Video Solution
Given that hash table $T$ with $25$ slots that stores $2000$ elements, the load factor $a$ for $T$ is _________.
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

6
views
gate20153
datastructures
hashing
normal
numericalanswers
videosolution
0
votes
0
answers
GATE2006IT20 Video Solution
Which of the following statement(s) is TRUE? A hash function takes a message of arbitrary length and generates a fixed length code. A hash function takes a message of fixed length and generates a code of variable length. A hash function may give the same hash value for distinct messages. I only II and III only I and III only II only
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

5
views
gate2006it
datastructures
hashing
normal
videosolution
0
votes
0
answers
GATE200936 Video Solution
The keys $12, 18, 13, 2, 3, 23, 5$ and $15$ are inserted into an initially empty hash table of length $10$ using open addressing with hash function $h(k) = k \mod 10$ ...
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

5
views
gate2009
datastructures
hashing
normal
videosolution
+1
vote
1
answer
GATE2020CS23 Video Solution
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_____________.
asked
Apr 18, 2020
in
Algorithms
by
admin
(
569
points)

22
views
gate2020cs
numericalanswers
algorithms
hashing
videosolution
0
votes
0
answers
GATE20047 Video Solution
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
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

2
views
gate2004
datastructures
hashing
easy
videosolution
0
votes
0
answers
GATE2008IT48 Video Solution
Consider a hash table of size $11$ that uses open addressing with linear probing. Let $h(k) = k \mod 11$ be the hash function used. A sequence of records with keys $43 \ 36 \ 92 \ 87 \ 11 \ 4 \ 71 \ 13 \ 14$ is inserted into an initially empty ... which are indexed from zero to ten. What is the index of the bin into which the last record is inserted? $3$ $4$ $6$ $7$
asked
Apr 18, 2020
in
DS
by
admin
(
569
points)

6
views
gate2008it
datastructures
hashing
normal
videosolution
0
votes
0
answers
GATE199013b Video Solution
Consider a hash table with chaining scheme for overflow handling: What is the worstcase timing complexity of inserting $n$ elements into such a table? For what type of instance does this hashing scheme take the worstcase time for insertion?
asked
Apr 18, 2020
in
Algorithms
by
admin
(
569
points)

24
views
gate1990
hashing
algorithms
videosolution
0
votes
0
answers
coal india 2020: Hashing
In hashing, collision resolution is carried out by close addressing. Which of the following is close addressing technique – I. Buckets (for contiguous storage) II. Chains (for linked storage) A. Only I B. Only II C. I and II D. None i think Buckets for continuous storage is like arrays so it will use linear probing (open addressing) chains – uses closed addressing.
asked
Mar 5, 2020
in
Programming
by
rjking7403
(
7
points)

115
views
hashing
+1
vote
1
answer
Virtual GATEHashing
Sequentially means one after another,there may or maynot gap between two, right?? Then how $m^{2}$ should be in denominator ?? What will be ans here, B) or C)??
asked
Feb 4, 2020
in
Algorithms
by
srestha
(
1k
points)

35
views
hashing
0
votes
0
answers
applied gate mock 5
asked
Jan 27, 2020
in
DS
by
abhinav649
(
31
points)

106
views
hashing
0
votes
1
answer
Hashing #Ace_Academy_Booklet
Identify valid hash function for storing in the address range $\mathbf{1}$ to $\mathbf{1000}$ $\mathbf{h(x) = x \;mod\;1000}$ $\mathbf{(x+1)\;mod\;1000}$ $\mathbf{h(x) = x \;mod\;(1000+1)}$ $\mathbf{h(x) = (x \;mod\;1000)+1}$ My Work: According to me answer is $\mathbf{1}$ but the given answer is $\mathbf{4}$
asked
Dec 19, 2019
in
Programming
by
`JEET
(
187
points)

52
views
hashing
algorithim
hashtable
0
votes
1
answer
GATEBOOK DSA
You are given a hash table with n keys and m slots, with the simple uniform hashing (assume each key is equally likely to be hashed into each slot). Collisions are resolved by chaining. What is the expected number of slots that end up not being empty ?
asked
Dec 2, 2019
in
DS
by
Sambhrant Maurya
(
485
points)

65
views
dsa
hashing
gatebook
0
votes
0
answers
gate previous year
https://gateoverflow.in/2272/gate199712 I dint understand the answer here. I would really appreciate if anybody could explain it with an example?
asked
Dec 2, 2019
in
Programming
by
chandrikabhuyan8
(
165
points)

18
views
hashing
0
votes
0
answers
GATE 2020 syllabus Data Structure
Is hashing topic in data structures has been removed because on the official website of gate iitd I am not seeing the hashing topic listed in the syllabus? Sorry, I know this isn't the type of question that people ask here but I just wanted to know.
asked
Aug 8, 2019
in
DS
by
setu bhaskar
(
5
points)

59
views
datastructures
hashing
0
votes
0
answers
Algorithm Hashing
Using open addressing with linear probing, we sequentially insert three distinct keys k1, k2 and k3 into a hash table of size m. Assuming simple uniform hashing, what is the probability that we will need three probes, when inserting the third key, k3? a.3/m^2 b. 3/m c.2/m d.2/m^2 anyone please explain above problem in detail….
asked
Jul 30, 2019
in
Algorithms
by
Manasa.M
(
11
points)

31
views
hashing
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
8,953
questions
3,113
answers
14,322
comments
95,780
users