Suppose you have a hash table of size N = 64, and you are using quadratic probing with c1 = 1 and c2 = 1. The keys in your hash are 4-digit integers (0000 through 9999) and your hash function is h(k) = (the sum of the digits in k). What are the first 4 values in the search sequence (starting with the home position) for a record with key k=1948? Blank # 1 Blank # 2 Blank # 3 Blank # 4

Using the values provided below, show the hash key and what the hash table will look like when using the two different techniques indicated. The hash function used is based upon the first letter of the person's last name. The array size is 27 Index 0 is not used The letter 'A' will go to index 1, 'B' to index 2, etc   Separate chaining Open addressing with linear probing   i_table = ( h(k) + j ) mod S where i is the index of the underlying array,h is the hash function,j is the iteration of the probe, andS is the size of the table Values needing to be hashed (in order from top to bottom) Big Bird The Penguin Jackie Chan The Joker The Riddler Lewis Carroll Arthur Doyle Clark Kent Clive Lewis Lois Lane Yogi Bear Charles Dickens Geoffrey Chaucer Mr Ranger William Shakespeare John Tolkien Fred Rogers

You are asked to insert the following values into the hashing table size 9: 9, 18, 19, 27, 8, 17. Use linear probing if there is a collision. Your answer will be in the form of the order of inserted elements. The order of inserted elements:: 9 18 19 - - 27 8 - 17 The order of inserted elements: 9 18 19 27 - - 17 - 8 O The order of inserted elements: 9 18 19 27 17 - - -8 O The order of inserted elements: 9 18 19 27 8 - -17 -

Suppose you are told to implement a open hash table that has at most 12,000 buckets and you expect to use up at most a half of that. What is the average number of attempts you expect to experience for any particular query? Round to the nearest 2 decimal places if necessary.