Given the hash function: H(key) = key/2; Hash table size = 7 and index = H(key)%...

Question

Question

Given the hash function: H(key) = key/2; Hash table size = 7 and index = H(key)%...

Given the hash function:

H(key) = key/2; Hash table size = 7 and index = H(key)% Hash table size

Show how the hash table below looks after adding the following (key, value) pairs, (illustrate your strategy for collision handling)

(3000, “A”)
(3232, “B”)
(1223, “C”)
(4569, “K”)
(6767, “F”)
(1234, “P”)
(2324, “F”)
(3422, “G”)
(1231, “R”)

index	Key	Value
0
1
2
3
4
5

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

Add a comment

Answer 2

Similar Homework Help Questions

1. Given a hash table with size 10, hash function is hash(k) = k % 10,...

1. Given a hash table with size 10, hash function is hash(k) = k % 10, and quadratic probing strategy is used to solve collisions. Please insert the keys 19, 68, 59, 20, 32, 88, 56 in the hash table. 2. Let T be a binary tree with 31 nodes, what is the smallest possible height of T? What is the largest possible height of T?
Assume a Hash table has 7 slots and the hash function h(k) = k mod 7...

Assume a Hash table has 7 slots and the hash function h(k) = k mod 7 is used. The keys 14, 3, 11, 6, 10, 4, 20, and 17 are inserted in the table with collision resolution by chaining. Assume that the keys arrive in the order shown. (a) Show the hash table obtained after inserting all 8 keys. [Show only the final table] (b) Under the assumption that each key is searched with probability 1/8, calculate expected number of...
11. Dra The size The hash function used is: the contents of the 13 hash tables...

11. Dra The size The hash function used is: the contents of the 13 hash tables below. Show your work for partial r hash table is HOk)-k mod 7 13, 17, 6, 24, 3 a) Resolve collisions with chaining b) Double hashing, where W20)-7-0mod 5) 0 1 1 2 2 3 3 4 4 5 5 6 6 c) What is the load factor for the table a? d) What is the load factor for the table b? f) Is...

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...
The task of this project is to implement in Java Hash Table structure using Linear Probing...

The task of this project is to implement in Java Hash Table structure using Linear Probing Collision Strategy. You can assume that no duplicates or allowed and perform lazy deletion (similar to BST). Specification Create a generic class called HashTableLinearProbe <K,V>, where K is the key and V is the value. It should contain a private static class, HashEntry<K,V>. Use this class to create array to represent Hashtable: HashEntry<K,V> hashtable[]; Implement all methods listed below and test each method...
List the contents of a hash table of SIZE 10 filled using chaining Use the hash function: index= ...

Java question need help For the data elements can be item1, item2, item3 ,item4.... etc. List the contents of a hash table of SIZE 10 filled using chaining Use the hash function: index= ((string. length() * 3) The data elements are: Add the elements in the order given List the elements contained in each "bucket" (if any) Elements should be chained in the order added, separated by a comma and a space If an index is empty enter the word...

This should be in Java Create a simple hash table You should use an array for...

This should be in Java Create a simple hash table You should use an array for the hash table, start with a size of 5 and when you get to 80% capacity double the size of your array each time. You should create a class to hold the data, which will be a key, value pair You should use an integer for you key, and a String for your value. For this lab assignment, we will keep it simple Use...
Create a hash table class/struct.in C++ Define an array that holds 27 elements. Define a function...

Create a hash table class/struct.in C++ Define an array that holds 27 elements. Define a function called Hash(int) -This function returns the modulo of that int by the size of the table (array). Define an add function that takes an integer. -This function takes the integer, determines the hash of that number by calling the above hash function, then adds it to the table using linear probing for collision resolution. Define a function that looks up a value, it takes...
Insert elements into a hash table implemented using chain hashing, as an array of linked list...

Insert elements into a hash table implemented using chain hashing, as an array of linked list in which each entry slot is as a linked list of key/value pairings that have the same hash (outcome value computed using certain hash function). You are allowed to use “Hash Function”, h(k) = k % x where, x is the value you will need to decide to use, that you find appropriate for this implementation. The main requirements are the following: 1. Input:...

#3 [3 points] Sketch a hash table of size N=11, where the hash function is hash(key) = key mod N and quadratic probing is used to resolve collisions, after the following elements are inserted: 20, 42,...

#3 [3 points] Sketch a hash table of size N=11, where the hash function is hash(key) = key mod N and quadratic probing is used to resolve collisions, after the following elements are inserted: 20, 42, 45, 49, 62, 72, 95. The probes are based on this equation: (H+c1∗i+c2∗i2)mod(N) and c1=1, c2=1. If direct hashing was used to store the same elements as the previous problems (20, 42, 45, 49, 62, 72, 95), what should be the minimum size of...

Given the hash function: H(key) = key/2; Hash table size = 7 and index = H(key)%...

Homework Answers

Add Answer to:
Given the hash function: H(key) = key/2; Hash table size = 7 and index = H(key)%...

Post as a guest

Earn Coins

1. Given a hash table with size 10, hash function is hash(k) = k % 10,...

Assume a Hash table has 7 slots and the hash function h(k) = k mod 7...

11. Dra The size The hash function used is: the contents of the 13 hash tables...

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(...

The task of this project is to implement in Java Hash Table structure using Linear Probing...

List the contents of a hash table of SIZE 10 filled using chaining Use the hash function: index= ...

This should be in Java Create a simple hash table You should use an array for...

Create a hash table class/struct.in C++ Define an array that holds 27 elements. Define a function...

Insert elements into a hash table implemented using chain hashing, as an array of linked list...

#3 [3 points] Sketch a hash table of size N=11, where the hash function is hash(key) = key mod N and quadratic probing is used to resolve collisions, after the following elements are inserted: 20, 42,...

Given the hash function: H(key) = key/2; Hash table size = 7 and index = H(key)%...

Homework Answers

Add Answer to: Given the hash function: H(key) = key/2; Hash table size = 7 and index = H(key)%...

Post as a guest

Earn Coins

Add Answer to:
Given the hash function: H(key) = key/2; Hash table size = 7 and index = H(key)%...