The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged chaining
0
votes
0
answers
1
CLRS HASHING(EXERCISE 11.23)
Q)Professor Marley hypothesizes that substantial performance gains can be obtained if we modify the chaining scheme so that each list is kept in sorted order. How does the professor's modification affect the running time for successful searches, unsuccessful searches, ... what basis are we going to sort the elements? As, In a list all the elements have same key values
asked
Dec 31, 2018
in
Algorithms
by
vk_9_1_9
(
123
points)

29
views
hashing
chaining
0
votes
0
answers
2
ADA:Hashing: Probability of collision
In the following question why is the probability multiplied by 2?
asked
Dec 8, 2018
in
Algorithms
by
chauhansunil20th
Active
(
4.8k
points)

59
views
algorithms
hashing
chaining
madeeasytestseries
+1
vote
1
answer
3
CLRS 11.26
Suppose we have stored n keys in a hash table of size m, with collisions resolved by chaining, and that we know the length of each chain, including the length L of the longest chain. Describe a procedure that selects a key uniformly at random from among the keys in the hash table and returns it in expected time O(L * (1 + m/n)).
asked
Jul 11, 2018
in
Algorithms
by
mohitjarvissharma
(
387
points)

105
views
algorithms
hashing
chaining
+1
vote
0
answers
4
Hash Table and IPv6
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = kmod 10 and linear probing. The number of different insertion sequence of the key values using the given hash function and linear ... send the packet from source to destination with minimum number of hops. D) both b and c. I think it is B).
asked
Jan 22, 2018
in
Programming
by
Shubhanshu
Boss
(
18.9k
points)

240
views
hashing
datastructure
chaining
computernetworks
ipv6
0
votes
1
answer
5
Hashing
If h is any hashing function and is used to hash n keys into a table of size m, here n<=m, the expected number of collisions involving a particular key x is a) Less than 1 b) Less than n c) Less than m d) Less than n/2
asked
Feb 8, 2017
in
DS
by
smartmeet
Active
(
5.1k
points)

865
views
hashing
datastructure
chaining
uniformhashing
+3
votes
2
answers
6
Given a hash table with n keys and m slots, with the simple uniform hashing assumption.....
asked
Feb 3, 2017
in
Programming
by
Smriti012
Active
(
4k
points)

704
views
hashing
datastructure
chaining
+3
votes
1
answer
7
UGCNETDec2015III8
Forward chaining systems are ____ where as backward chaining systems are ____ Data driven, Data driven Goal driven, Data driven Data driven, Goal driven Goal driven, Goal driven
asked
Aug 9, 2016
in
Mathematical Logic
by
jothee
Veteran
(
115k
points)

742
views
ugcnetdec2015ii
artificialintelligence
chaining
0
votes
1
answer
8
What is time complexity of inserting an element in chaining(outside) hashing technique?
asked
Dec 23, 2015
in
Algorithms
by
piyushkr
(
313
points)

310
views
chaining
hashing
0
votes
1
answer
9
Hashing
asked
Dec 16, 2015
in
Algorithms
by
Himanshu1
Boss
(
15.8k
points)

205
views
hashing
chaining
+5
votes
2
answers
10
Hashing
Consider a hash table with $n$ buckets, where external(overflow) chaining is used to resolve collision. The hash function is such that the probability that a key value is hashed to a particular bucket is $\dfrac 1 n$. The hash table is initially empty and $k$ distinct values are inserted in the table. Q) What is ... $n(n  1)(n  2)(n  k  1)/n^k$ both (a) and (b) none
asked
Oct 17, 2015
in
Algorithms
by
Nishikant kumar
(
435
points)

564
views
hashing
chaining
probability
0
votes
1
answer
11
hashing
asked
Oct 9, 2015
in
Algorithms
by
Shefali
Active
(
1.2k
points)

193
views
hashing
chaining
0
votes
1
answer
12
simple uniform hashing
why in a hash table in which collisions are resolved by a chaining , a successful search takes average case time ⊖(1+load factor) ,under the assumption of simple uniform hashing ?
asked
May 27, 2015
in
DS
by
anurag_am
(
199
points)

715
views
hashing
chaining
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
Recent Posts
Relax... But....
Barc : Arjun Sir
JEST Sample Question
Manipal institute of technology , Vellore Institute of technology, BARC, Interview M.Tech
What to do and scared for future
Follow @csegate
Recent questions tagged chaining
Recent Blog Comments
or u can upload the pdf file on google drive...
send me at
[email protected]
Do IITB/IISc also have winter admissions?
Selection criteria is same. Though cut off scores...
47,886
questions
52,255
answers
182,152
comments
67,672
users