Let the array size m = 23 = 8. Compute the linear probe sequence h(k, i)...
- Let the array size m = 23 = 8.
- Compute the linear probe sequence h(k, i) = ( h'(k) + i ) mod m, i = 0, 1, … m−1. Presume h'(k) = 4.
- Compute the quadratic probe sequence h(k, i) = ( h'(k) + i(i+1)/2 ) mod m. Presume h'(k) = 4.
- Compute the double-hashing probe sequence h(k, i) = ( h1(k) + i h2(k) ) mod m, for each of k1 and k2, presuming h1(k1) = h1(k2) = 4, h2(k1) = 5, h2(k2) = 7.
Homework Answers
Add Answer to:
Let the array size m = 23 = 8.
Compute the linear probe sequence h(k, i)...
3. (20 points) In open addressing with double hashing, we have h(k,i) hi(k)+ih2(k) mod m, where h...
3. (20 points) In open addressing with double hashing, we have h(k,i) hi(k)+ih2(k) mod m, where hi(k) and h2(k) is an auxiliary functions. In class we saw that h2(k) and m should not have any common divisors (other than 1). Explain what can go wrong if h2(k) and m have a common divisor. In particular, consider following scenario: m- 16, h(k) k mod (m/8) and h2(k)-m/2 and the keys are ranged from 0 to 15. Using this hash function, can...
Let 'M' denote the hash table size. Consider the following four different hash table implementations: a....
Let 'M' denote the hash table size. Consider the following four different hash table implementations: a. Implementation (I) uses chaining, and the hash function is hash(x)x mod M. Assume that this implementation maintains a sorted list of the elements (from biggest to smallest) for each chain. b. Implementation (II) uses open addressing by Linear probing, and the hash function is ht(x) - (hash(x) + f(i)) mod M, where hash(x)x mod M, and f(i)- c. Implementation (III) uses open addressing by...
5. Hashing (a) Consider a hash table with separate chaining of size M = 5 and...
5. Hashing (a) Consider a hash table with separate chaining of size M = 5 and the hash function h(x) = x mod 5. i. (1) Pick 8 random numbers in the range of 10 to 99 and write the numbers in the picked sequence. Marks will only be given for proper random numbers (e.g., 11, 12, 13, 14 ... or 10, 20, 30, 40, .. are not acceptable random sequences). ii. (2) Draw a sketch of the hash table...
Please Answer as soon as possible. Thank you so much. 5. Below is an array with...
Please Answer as soon as possible. Thank you so
much.
5. Below is an array with 15 positions, which is used as a hash table to keep some IDs. The key to each record is the 3-digit customer's ID. The hash function h gives the index of the slot in the array for the key k: h(k)=%15. The method of collision resolution is double hashing. Hence, if collision happens, we repeatedly compute (h(key) + iha(key)) mod 15, for i from...
10. Submission In this question you will work with a hash table that uses double hashing. The hash table is size 11, the primary hash function is h(K)-K mod 11, and the secondary hash function is hp(...
10. Submission In this question you will work with a hash table that uses double hashing. The hash table is size 11, the primary hash function is h(K)-K mod 11, and the secondary hash function is hp(K)-(K mod9) +1 Take an empty hash table. Take your student number and split it into 4 2-digit integers. Insert each of these 2-digit numbers in the order in which they appear in your student number into the empty heap. Then insert the values...
Please select file(s) Select file(s) Q9 Double 15 Points Consider inserting the keys 10, 22, 31,...
Please select file(s) Select file(s) Q9 Double 15 Points Consider inserting the keys 10, 22, 31, 4, 15, 28, 17, 88, 59 into a hash table of length m 11 using open addressing with the auxiliary hash function l'(k) = k. Illustrate the result of inserting these keys using linear probing, using quadratic probing with c1 3, and using double hashing with h1(k) = k and h2(k) = 1 + (k mod (m – 1)). See Cormen p.272 1 and...
An m×n array A of real numbers is a Monge array if for all i,j,k, and l such that 1≤i<k≤m and ...
An m×n
array A
of real numbers is a Monge array if for all i,j,k,
and l
such that 1≤i<k≤m
and 1≤j<l≤n
, we have
>A[i,j]+a[k,l]≤A[i,l]+A[k,j]>
In other words, whenever we pick two rows and two columns of a
Monge array and consider the four elements at the intersections of
the rows and columns, the sum of the upper-left and lower-right
elements is less than or equal to the sum of the lower-left and
upper-right elements. For example, the following...
4. Hashing and Hash Tables. You need to use the ASCII table in the last page for this question. Study the following hash functions for ASCII C strings that are at least 3-char long unsigned hash1(con...
4. Hashing and Hash Tables. You need to use the ASCII table in the last page for this question. Study the following hash functions for ASCII C strings that are at least 3-char long unsigned hash1(const char, unsigned unsigned vto]+01997 return (v % m); unsigned hash2Cconst char unsigned) unsigned v-o]k(2] 877 return 1 + (v % ( -1)); (a) Given that m-, 7, compute the hash values and fill the following table (3%) String k hash1k, ) hash2(k, 7) aph...
in C++ Code should work for all cases In this assignment you are requested to implement...
in C++
Code should work for all cases
In this assignment you are requested to implement insert, search, and delete operations for an open-addressing hash table with double hashing. Create an empty hash table of size m= 13. Each integer of the input will be a key that you should insert into the hash table. Use the double hashing function h{k, i) = (hı(k) + ih2(k)) mod 13 where hi(k)= k mod 13 and h2(k) = 1+(k mod 11). The...
The table below shows several items and their hashcodes, as derived from some arbitrary hashing function....
The table below shows several items and their hashcodes, as derived from some arbitrary hashing function. Assume you have a hashtable with an initial array size of 13 (0-based) and a load factor of 0.75. Assume the array is always doubled when it needs to be resized (i.e., the table size sequence is: 13, 26, 52, 104, ...). Assume the items are added in the order in which they are listed, and assume the hashtable uses quadratic probing to resolve...
3. (20 points) In open addressing with double hashing, we have h(k,i) hi(k)+ih2(k) mod m, where hi(k) and h2(k) is an auxiliary functions. In class we saw that h2(k) and m should not have any common divisors (other than 1). Explain what can go wrong if h2(k) and m have a common divisor. In particular, consider following scenario: m- 16, h(k) k mod (m/8) and h2(k)-m/2 and the keys are ranged from 0 to 15. Using this hash function, can...
Let 'M' denote the hash table size. Consider the following four different hash table implementations: a. Implementation (I) uses chaining, and the hash function is hash(x)x mod M. Assume that this implementation maintains a sorted list of the elements (from biggest to smallest) for each chain. b. Implementation (II) uses open addressing by Linear probing, and the hash function is ht(x) - (hash(x) + f(i)) mod M, where hash(x)x mod M, and f(i)- c. Implementation (III) uses open addressing by...
5. Hashing (a) Consider a hash table with separate chaining of size M = 5 and the hash function h(x) = x mod 5. i. (1) Pick 8 random numbers in the range of 10 to 99 and write the numbers in the picked sequence. Marks will only be given for proper random numbers (e.g., 11, 12, 13, 14 ... or 10, 20, 30, 40, .. are not acceptable random sequences). ii. (2) Draw a sketch of the hash table...
Please Answer as soon as possible. Thank you so
much.
5. Below is an array with 15 positions, which is used as a hash table to keep some IDs. The key to each record is the 3-digit customer's ID. The hash function h gives the index of the slot in the array for the key k: h(k)=%15. The method of collision resolution is double hashing. Hence, if collision happens, we repeatedly compute (h(key) + iha(key)) mod 15, for i from...
10. Submission In this question you will work with a hash table that uses double hashing. The hash table is size 11, the primary hash function is h(K)-K mod 11, and the secondary hash function is hp(K)-(K mod9) +1 Take an empty hash table. Take your student number and split it into 4 2-digit integers. Insert each of these 2-digit numbers in the order in which they appear in your student number into the empty heap. Then insert the values...
Please select file(s) Select file(s) Q9 Double 15 Points Consider inserting the keys 10, 22, 31, 4, 15, 28, 17, 88, 59 into a hash table of length m 11 using open addressing with the auxiliary hash function l'(k) = k. Illustrate the result of inserting these keys using linear probing, using quadratic probing with c1 3, and using double hashing with h1(k) = k and h2(k) = 1 + (k mod (m – 1)). See Cormen p.272 1 and...
An m×n
array A
of real numbers is a Monge array if for all i,j,k,
and l
such that 1≤i<k≤m
and 1≤j<l≤n
, we have
>A[i,j]+a[k,l]≤A[i,l]+A[k,j]>
In other words, whenever we pick two rows and two columns of a
Monge array and consider the four elements at the intersections of
the rows and columns, the sum of the upper-left and lower-right
elements is less than or equal to the sum of the lower-left and
upper-right elements. For example, the following...
4. Hashing and Hash Tables. You need to use the ASCII table in the last page for this question. Study the following hash functions for ASCII C strings that are at least 3-char long unsigned hash1(const char, unsigned unsigned vto]+01997 return (v % m); unsigned hash2Cconst char unsigned) unsigned v-o]k(2] 877 return 1 + (v % ( -1)); (a) Given that m-, 7, compute the hash values and fill the following table (3%) String k hash1k, ) hash2(k, 7) aph...
in C++
Code should work for all cases
In this assignment you are requested to implement insert, search, and delete operations for an open-addressing hash table with double hashing. Create an empty hash table of size m= 13. Each integer of the input will be a key that you should insert into the hash table. Use the double hashing function h{k, i) = (hı(k) + ih2(k)) mod 13 where hi(k)= k mod 13 and h2(k) = 1+(k mod 11). The...
Most questions answered within 3 hours.
-
What kinds of transitions form the basis for AA and AE?
Can the detector differentiate wavelengths...
asked 5 minutes ago -
Twenty percent of all telephones of a certain type are submitted
for service while under warranty....
asked 6 minutes ago -
A
roller coaster cart of mass 312 kg travels around a horizontal
curve of radius 41.3...
asked 6 minutes ago -
If I have a function in python, say show(B), how would I code it
so that...
asked 7 minutes ago -
Size properly the power supply that you need to purchase if you
have the following equipment....
asked 8 minutes ago -
Is voter turnout in Texas a problem? If so how can this issue be
addressed to...
asked 14 minutes ago -
Assume we have these two classes. Note that they are in
separate packages. If the code...
asked 26 minutes ago -
In 250 words, Which theory made the most sense to you in
explaining crimes in a...
asked 25 minutes ago -
An undiscovered planet, many light-years from Earth, has one
moon, which has a nearly circular periodic...
asked 26 minutes ago -
Design and implement a simple, interactive shell program that
prompt the user for a command, parser...
asked 37 minutes ago -
Describe some respiratory and cardiovascular adaptations
enabling dolphins to stay underwater for long periods of time....
asked 43 minutes ago -
In a Poisson distribution, μ=.30μ=.30. (Round your
answers to 4 decimal places.)
(a)
What is...
asked 46 minutes ago