MCQ:(NEED ANSWERS) 6. Insert {20, 25, 13, 22, 4, 9, 29, 35, 14, 17} one by one into an initially empty hash table of size 13 with the hash function H(Key)=Key%13, and quadratic probing is used to resolve collisions. How many numbers can be inserted without collisions? a) 8 b) 5 c) 7 d) 6 If N keys are hashed into the same slot with separate chaining used to solve collisions, then the number of comparisons for finding these N keys is _ a) N+1 b) N(N+1)/2 c) N(N-1)/2 d) N Given input {321, 156, 57, 46, 28, 7, 331, 33, 34, 63}. Which one of the following is the result after the 1st run of the Least Signification Digit (LSD) radix sort? a) 321-331-33-63-34-156-46-57-7-28 b) 331-321-33-63-34156-46-577-28 c)57-46-28733-3463-156-321-331 d) 156-28-321-331-33-34-46-57-63-7 9. Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x)=X%10. If the collisions are solved by open addressing hash table with second hash function h2 (X)=7-(X%7) and table size being 10, then the indices of the input numbers in the hash table are: (-1 means the insertion cannot be successful) a) 1, 3, 4, 9, 5, 0, 2 b) 1, 3, 4, 9, 7, 5, -1 c) 1, 3, 4, 9, 5,0,8 d) 1, 3, 3, 9, 4, 9,9 10. Insert {9, 8, 7, 2, 3, 5, 6, 4} one by one into an initially empty AVL tree. How many of the following statements is/are FALSE? the total number of rotations made is 4 (Note: double rotation counts 2 and single rotation counts 1) the expectation (round to 0.01) of access time is 2.75 there are 1 nodes with a balance factor of -1 a) 0 b) 1 c) 2 d) 3