Answer Happy

Question 9 Suppose you are given the following set of keys to insert into a hash table that holds exactly 13 values (h(K) = k mod 13): 26 , 13, 14, 15 How many of the elements can be stored in their HOME location after all the keys have been inserted using doub hashing H2(K) = 1 1+1 ((K/13) mod (12) Selected Answer: 4 Answers: 1 Question 10 performs the worst when time for comparisons is the focus for sorting the following: 1.20, 30, 50, 100, 180, 5378 into ascending order (Choose the BEST answer). Selected Answer: Selection Sort Insertion Sort Answers: BubbleSort Selection Sort Both Bubble and Selection Sort Insertion, Bubble, and Selection Sort have the same performance Question 11 Build a huffman coding tree based on the symbols and corresponding frequencies below. 31 9 3 15 6 12 12 22 IT W o IS |Н G Then answer the following questions: a. What's the original message for coding 001011101101000000100001000011 ? b. What is the expected cost per letter? You must show your step by step calculation to receive any credit for this subquestion. Make sure to write the question number in front of your answers. Selected Answer: [None Given)