Answer Happy

Question 11 Which of following is true about hashing mechanism in which collisions are handled using probing? Select all that apply Linear hashing may results in secondary clustering Records are stored as a linked list Deleting is not possible when we use probing Quadratic hashing eliminates primary clustering < Previous 4 pts [ Not saved
Question 12 What is the best possible asymptotic running time of any given sorting algorithm that use comparisons in sorting int key values? OO (log n) O O(n) O O(n log n) O 0(k) 2 pts Previous Not saved Ne
Question 13 Which of the following is NOT an acceptable table size for a hash table that uses chaining. Select all that apply 512 503 500 507 < Previous 4 pts Not saved Ne