Data Structures: Hashing Exercise: 1. a) Given an empty “separate chaining hash table” of size 10,...

Data Structures:

Hashing Exercise:

1. a) Given an empty “separate chaining hash table” of size 10, with hash function

Location = Number modulus 10

Show the hash table after inserting the following numbers: 21, 18, 27 , 31 , 48, 51 , 37, 98, 17

b) What table size would be better? 11? 12? 20?

2. We want to hash name strings into a chaining hash table of size 10, how would you divide the alphabet into 10 groups? Hash our class first names into your new Hash table.

3. Given an empty “Open addressing with linear probing hash table”, Show the hash table after inserting the following numbers: 27, 36, 45, 14, 56, 22. What is a good table size?

4. If the expected data size is about 2000, what is a good size for the hash table?

5. Try both linear and quadratic probing in a table of size 10, use the numbers 11, 21, 71, 14, 51

Expert Solution

b) If the table size will be 11 then it would be better. Because the total number of elements is only 9.

venereology answered 1 year ago

Use double hashing and the following hash functions: hash(key) = (key % table size) and hash2(key)...

Use double hashing and the following hash functions: hash(key) = (key % table size) and hash2(key) = (16 - (key % 10)) + 1 to insert the following numbers into a dictionary's hash table: 1, 12, 14, 3, 5 and 17. The table size is 11. Show the table and where each value is inserted. No coding required for this problem.

1.Consider hashing with a table size of 100 and a hash function of key%tablesize. Insert 25...

1.Consider hashing with a table size of 100 and a hash function of key%tablesize. Insert 25 keys. Do you expect to see any collisions? Why or why not? Yes, because random values likely will land on same locations. No becase there are four times as many slots as needed. 2. Secondary clustering means that elements that hash to the same position will probe to the same alternate cells. Simple hashing uses key%tablesize as the hash function. Which of the following...

Develop an algorithm to demonstrate hashing using hash table with modulo as the hash function. Assume...

Develop an algorithm to demonstrate hashing using hash table with modulo as the hash function. Assume the size of the hash table as 10. To avoid collisions in case of identical keys for two different elements, use Linear Probing collision resolution technique. using c++ add comment on the code

Assume that you are hashing key K to a hash table of n slots (indexed from...

Assume that you are hashing key K to a hash table of n slots (indexed from 0 to n - 1). For each of the following functions h(K), answer the following question(s): 1) Is the function acceptable as a hash function (i.e., would the has program work correctly for both insertions and searches), 2) and if so, is it a good hash function? Function rand(n) returns a random integer between 0 and n - 1. Also assume k is a...

Every developer is focused on transmitting data securely. Hashing and hash functions are essential for securing...

Every developer is focused on transmitting data securely. Hashing and hash functions are essential for securing business information and data. While the term cryptographic hash function may sound intimidating, it’s much simpler than it sounds. For this assignment, expand on the information provided in the course and fully address the items below. Write a 2- to 3-page paper in which you: Define cryptographic hash function (CHF). Elaborate on the main properties and definitions of an ideal cryptographic hash function. Propose...

3. Assume a hash table with 7 locations and the hashing function h(i) = i%7. Show...

3. Assume a hash table with 7 locations and the hashing function h(i) = i%7. Show the hash table that results when the integers are inserted in the order given. (10 points each. Total 30) • 5, 11, 18, 23, 28, 13, 25, with collisions resolved using linear probing • 5, 11, 18, 23, 28, 13, 25, with collisions resolved using quadratic probing • 5, 11, 18, 23, 28, 13, 25, with collisions resolved using chaining.

Write a program to insert the following elements into a hash table of size 17. The...

Write a program to insert the following elements into a hash table of size 17. The hash function is X mod 17 where X is the input element. 6, 12, 34, 29, 28, 11, 23, 7, 0, 33, 30, 45 Use linear probing to resolve any collisions.

Implement a Cuckoo hash table in which two separate tables are maintained. Each table should have...

Implement a Cuckoo hash table in which two separate tables are maintained. Each table should have a fixed size of 13. Use the hash function h1(x) = x mod 13 for the first table, and h2(x)= 11 – (x mod 11) for the second table. Your program should read an input file, input.txt, consisting of one input per line, insert the input to the table in order, and print out the final content of the hash table in the provided...

1.) Consider inserting values 15, 22 and 29 in the order given into a hash table...

1.) Consider inserting values 15, 22 and 29 in the order given into a hash table of size 7 with hash function h(x) = x mod 7. What will be the locations be the respective locations for 15, 22 and 29 in the hash table if quadratic probing is used to resolve colisions? a. 1, 2, 4 b. 1, 2, 3 c. 1, 2, 0 d. 1, 1, 1 2.) Consider the following sequences of addqs and removeqs, what order...

(10 pts) Draw the result of hashing 11, 22, 3, and 43 into a table using...

(10 pts) Draw the result of hashing 11, 22, 3, and 43 into a table using the following hash function, using separate chaining: h(x) = x % 4 0 1 2 3 (10 pts) Draw the result of hashing 11, 22, 3, and 43 into a table using the following hash function, using open addressing with linear probing: h(x) = x % 4 0 1 2 3

Question