Use a hash table with a fixed size of 10. Don't grow the table or do...

Question

Question

Use a hash table with a fixed size of 10. Don't grow the table or do any rehashing. Use the hash function H(x) = x % 10.

Use Quadratic Probing to resolve collisions in part a, b and c:

a) Insert the items into an initially empty hash table. Draw the table that results. 71 23 73 99 44

b) Draw the table that results from adding 79 to the table in part a

c) Draw the table that results from adding 89 to the table in part b

Answer 1

Similar Homework Help Questions

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...
6. A hash table has size 7, uses quadratic probing (f(i) = 1), and has hash...

6. A hash table has size 7, uses quadratic probing (f(i) = 1), and has hash function h(2) = 2%7. (Recall, % is the Java "mod" function.) Draw the contents of the hash table after the following sequence of insertions: insert 0, insert 7, insert 14, insert 21. The hash table is initially empty.
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?

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...
Insertthe following numbres into a initially empty hash table of size 10. The functions h(x) =...

Insertthe following numbres into a initially empty hash table of size 10. The functions h(x) = x % 10. Use linear probing when collision happens. Draw the hash tables and show the intermediate steps. 8,15,6,25,77,39
^b Given input( 66, 28, 43, 29, 44, 69, 19) and a hash function h(x) =...

^b Given input( 66, 28, 43, 29, 44, 69, 19) and a hash function h(x) = x mod 10, show the resulting hash table 1) Using Separate Chaining 2) Using Linear Probing 3) Using Quadratic Probing 4) Starting with the following hash function: h2(x) 7- (x mod 7), applv Rehash ary course slides ing as described in the prim Rehashing Increases the size of the hash table when load factor becomes "too high" (defined by a cutoff) - Anticipating that...

java Assume that a hash set given the name set is initially empty, the set is...

java Assume that a hash set given the name set is initially empty, the set is implemented using an array of length 13, the hash function is h(x) = x % T (where T is the length of the array), and that quadratic probing is used if there are collisions. Show the state of the array after each operation: a. set.add(5); b. set.add(19); c. set.add(31); d. set.add(14); e. set.add(44);
13) consider the following sequence of keys to be inserted in a hash table of size...

13) consider the following sequence of keys to be inserted in a hash table of size 13 that uses a quadratic probing to resolve collisions select the choice that indicateds what the hash table looks like after all the keys are inserted (0 indicates an empty slot) {23, 4, 78 , 17 , 30, 81, 41, 5} a) 78, 41, 0, 81, 4, 5, 17, 0, 30, 0, 23, 0, 0 b) 78, 17, 41, 81, 4, 5, 0, 30,...
Show how the following data would be stored in a hash table of size 7 (the...

Show how the following data would be stored in a hash table of size 7 (the size is fixed) using quadratic probing. If any insertion fails, indicate that, but keep trying to insert all the remaining data. The hash function is hash(x) = x mod 7. Here is the data to be stored: 17, 10, 31, 45, 3, 53, 14. Insert the data in the order given. Data: Index: 0 1 2 3 4 5 6 4 data: Index: 31...

Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60,...

Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers keys in post-order - Retrieve the integers keys in pre-order - Draw a binary search tree after node 58 is deleted b) Create a Hash Table using the methods described below. Show the final array after all integer keys are inserted. Assumes that...