Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged chaining
0
votes
0
answers
1
CLRS HASHING(EXERCISE 11.2-3)
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
Q)Professor Marley hypothesizes that substantial performance gains can be obtainedif we modify the chaining scheme so that each list is kept in sorted order. Howdoes the ...
vk_9_1_9
628
views
vk_9_1_9
asked
Dec 31, 2018
Algorithms
hashing
chaining
+
–
1
votes
1
answer
2
CLRS 11.2-6
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)).
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 lo...
mohitjarvissharma
782
views
mohitjarvissharma
asked
Jul 11, 2018
Algorithms
algorithms
hashing
chaining
+
–
2
votes
1
answer
3
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).
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 num...
Shubhanshu
1.2k
views
Shubhanshu
asked
Jan 22, 2018
Programming in C
hashing
data-structures
chaining
computer-networks
ipv6
+
–
0
votes
1
answer
4
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
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 isa) Less than 1...
smartmeet
4.5k
views
smartmeet
asked
Feb 8, 2017
DS
hashing
data-structures
chaining
uniform-hashing
+
–
3
votes
2
answers
5
Given a hash table with n keys and m slots, with the simple uniform hashing assumption.....
Given a hash table with n keys and m slots, with the simple uniform hashing assumption (each key is equally likely to be hashed into each slot). Collisions are resolved by chaining. (a) What is the probability ... slot ends up empty? (b) What is the expected number of slots that end up not being empty?
Given a hash table with n keys and m slots, with the simple uniform hashing assumption (each key is equally likely to be hashed into each slot). Collisions are resolved b...
Smriti012
5.8k
views
Smriti012
asked
Feb 3, 2017
Programming in C
hashing
data-structures
chaining
+
–
0
votes
1
answer
6
Hashing
A hash table of length 100 uses chaining.What is the probability that all the values are hashed into the same slot after 5 insertions?
A hash table of length 100 uses chaining.What is the probability that all the values are hashed into the same slot after 5 insertions?
nandini gupta
683
views
nandini gupta
asked
Jan 22, 2017
Algorithms
algorithms
hashing
chaining
descriptive
+
–
0
votes
1
answer
7
Hashing
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining). 1)What is the probability that the first slot of hash table will be empty? 2)What is the expected number of slots that are being nonempty?
Consider a Hash table containing ‘n’ keys and ‘k’ slots. Each key will hash into a slot in the given Hash table. (Assume collisions are resolved by chaining).1)Wh...
Rohan Mundhey
1.7k
views
Rohan Mundhey
asked
Nov 9, 2016
Algorithms
hashing
chaining
probability
descriptive
+
–
2
votes
1
answer
8
hash table
A chained hash table has an array size of 100. What is the maximum number of entries that can be placed in the table ? (A) 100 (B) 200 (C) 10000 (D) There is no upper limit
A chained hash table has an array size of 100. What is the maximum number of entries that can be placed in the table ?(A) 100 (B) 200(C) 10000 (D) ...
omveer
2.5k
views
omveer
asked
Aug 27, 2016
Algorithms
algorithms
hashing
chaining
+
–
3
votes
2
answers
9
UGC NET CSE | December 2015 | Part 3 | Question: 8
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
Forward chaining systems are ____ where as backward chaining systems are ____Data driven, Data drivenGoal driven, Data drivenData driven, Goal drivenGoal driven, Goal dri...
go_editor
5.7k
views
go_editor
asked
Aug 9, 2016
Artificial Intelligence
ugcnetcse-dec2015-paper3
artificial-intelligence
chaining
+
–
0
votes
1
answer
10
What is time complexity of inserting an element in chaining(outside) hashing technique?
If we are inserting an element in chaining(outside) hashing technique, then what will be the time complexity in best case, average case and Worst case.
If we are inserting an element in chaining(outside) hashing technique, then what will be the time complexity in best case, average case and Worst case.
piyushkr
2.5k
views
piyushkr
asked
Dec 23, 2015
Algorithms
chaining
hashing
+
–
0
votes
1
answer
11
Hashing
Himanshu1
779
views
Himanshu1
asked
Dec 16, 2015
Algorithms
hashing
chaining
probability
numerical-answers
test-series
+
–
5
votes
2
answers
12
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
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...
Nishikant kumar
1.2k
views
Nishikant kumar
asked
Oct 17, 2015
Algorithms
hashing
chaining
probability
+
–
1
votes
1
answer
13
hashing
Shefali
694
views
Shefali
asked
Oct 8, 2015
Algorithms
hashing
chaining
test-series
+
–
0
votes
1
answer
14
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 ?
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 unifo...
anurag_am
1.3k
views
anurag_am
asked
May 27, 2015
DS
hashing
chaining
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
