Given a hash table that has 7 available addresses (index starts at 0), apply the division method to insert the following into the hash table: 403, 125, 359, 103, 235, 222. Use chaining to resolve collisions. After completing all the insertions, answer the questions below: 1. True/False: There will be 1 address left that is still empty after all 6 insertions are done. False 2. True/False: Key 235 is stored in its home address. [Select] 3. How many keys are stored in address (index) 5? 2

Given a hash table that has 7 available addresses (index starts at 0), apply the division method to insert the following into the hash table: 403, 125, 359, 103, 235, 222. Use chaining to resolve collisions. After completing all the insertions, answer the questions below: 1. True/False: There will be 1 address left that is still empty after all 6 insertions are done. False 2. True/False: Key 235 is stored in its home address. [Select] 3. How many keys are stored in address (index) 5? 2

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Question 5 Assume you have a hash table of size 13, insert the following keys using open addressing with linear probing, assuming that the H(Key) = key % size and the bucket size is equal to 1. Keys: 25, 66, 710, 150, 82, 111, 70,17 a. index key 0 1 66 2 3 4 82 5 70 6 17 7 150 8 710 9 111 10 11 25 12 b. index key 1 2 66 3 4 5 82 6 70 7 17 8 150 9 710 10 111 11 12 13 25 c. index key 0 1 66 2 3 4 82 5 70 6 17 7 150 8 111 9 710 10 11 12 25 d. index key 0 1 66 2 3 4 82 5 70 6 17 7 150 8 710 9 111 10 11 12 25
Given values below: 66 47 87 900 126 140 145 500 177 285 393 395 467 566 620 735 Store the values into a hash table with ten buckets, each containing three slots. If a bucket is full, use the next (sequential) bucket that contains a free slot. And Store the values into a hash table that uses the hash function key % 10 to determine into which of ten chains (separate chaining) to put the value?
Suppose a hash table has 11 locations, keys are placed in the table using the hash function f (x) = x mod 11, and linear chaining is used to resolve collisions Draw a picture of the result of storing the following keys in the table: 0, 12, 42, 18, 6, 22, 8, 105, 97
you are required to insert some keys into a hash table, using given hash functions. You have to Draw a Hash table with the inserted keys. Write total number of collisions encountered when a particular collision resolution technique is used. Size=11, H(X) = sum of Ascii codes of key % HTSIZE Keys: Mia, Tim, Zoe, Sam, Rae, Max, Meo, Jan, Sue, Moe, Zod, Len Use chaining Technique
Implement a dynamically resizable hash table to store people’s names and Social Security numbers. Use the extraction method with division using the last four digits of the Social Security number. Use an initial table size of 31 and a load factor of 0.80. Use open addressing with double hashing using an extraction method on the first three digits of the Social Security number.
A well designed hash function normally has multiple properties, including collision resistance, which means it is very hard for one to find a pair of inputs x≠y, such that h(x) = h(y). Could we just use a collision resistant function to do encryption? i.e., Enc(k,m)=f(k,m), where f is a collision resistant function.
Suppose you have a hash table with seven entries (indexed 0 through 6). This table uses open addressing with the hash function that maps each letter to its alphabet code (a = A = 0, etc.) modulo 7. Rehashing is accomplished using linear-probing with a jump of 1. Describe the state of the table after each of the letters D, a, d, H, a, and h are added to the table.
2. Give the contents of the resulting hash table when you insert items with the keys L A G U N I V E R S in that order into an initially empty table of M = 5 lists, using separate chaining with unordered lists. Use the hash function 11k mod M to transform the kth letter of the alphabet into a table index. Example: hash(J) hash(10) = 110 % 5 = 0
Consider an empty hash table of size 7. Draw the table that results after inserting, in the given order,the following key values: {19, 26, 13, 48, 17} when collisions are managed and handled by doublehashing method with function: ?(?,?) = [??(?) + ? ∗ ??(?)] ??? ?, where ℎ1(?) = ? ??? 7and ℎ2(?) = 5 − (? ??? 5).
Show what occurs when the keys 5, 28, 19, 15, 20, 33, 12, 17, and 10 are inserted into a hash table with collisions addressed by chaining. If the table has nine slots, then the hash function should be h.k/D k mod nine.
Use the following values to answer the questions bellow 66 47 87 900 126 140 145 500 177 285 393 395 467 566 620 735Store the values into a hash table with ten buckets, each containing three slots. If a bucket is full, use the next (sequential) bucket that contains a free slot.
Suppose you are given the following set of keys to insert into a hash table that holds exactly 11 values: 113, 117, 97, 100, 114, 108, 116, 105, 99. Using the hash function= value %table_size. Which of the following best demonstrates the contents of the hash table after all the keys have been inserted using linear probing? 100,__,__,113,114,105,116,117,97,108,99 99,100,__,113,114,__,116,117,105,97,108 100,113,117,97,14,108,116,105,99,__,__ 117,114,108,116,105,99,__,__,97,100,113