[Solved]1 Consider Inserting Data Integer Keys 22 14 12 48 36 12 Order Hash Table Size 11 Hashing Q37237370

1. Consider inserting data with integer keys 22, 14, 12, 48, 36, 12 in that order into a hash table of size 11 where the hashing function is h(key) % 11. a) Show a chaining hash table after doing the insertions. b) Show an open addressing with linear probing hash table c) Show an open addressing with quadratic probing hash [4points) after doing the insertions. [4 points) table after doing the insertions. [4 points) 2. Graph Basics & Representation a) Draw an adjacency matrix representation of this graph. (3 points) b) Draw an adjacency list representation of this graph. (3 points) c) Provide an O (Big-0h) bound on the space used by the adjacency matrix representation. 2 points) Show transcribed image text 1. Consider inserting data with integer keys 22, 14, 12, 48, 36, 12 in that order into a hash table of size 11 where the hashing function is h(key) % 11. a) Show a chaining hash table after doing the insertions. b) Show an open addressing with linear probing hash table c) Show an open addressing with quadratic probing hash [4points) after doing the insertions. [4 points) table after doing the insertions. [4 points) 2. Graph Basics & Representation a) Draw an adjacency matrix representation of this graph. (3 points) b) Draw an adjacency list representation of this graph. (3 points) c) Provide an O (Big-0h) bound on the space used by the adjacency matrix representation. 2 points)

Expert Answer

---

Answer to 1. Consider inserting data with integer keys 22, 14, 12, 48, 36, 12 in that order into a hash table of size 11 where the… . . .