Q(1) Choose the correct answer :-(13 Pts.) 2 3 4 5 6 1 7 8 9 10 11 12 13 1. What feature of heaps allows them to be effi

[answerhappygod]

Q 1 Choose The Correct Answer 13 Pts 2 3 4 5 6 1 7 8 9 10 11 12 13 1 What Feature Of Heaps Allows Them To Be Effi 1 (84 KiB) Viewed 27 times

Q(1) Choose the correct answer :-(13 Pts.) 2 3 4 5 6 1 7 8 9 10 11 12 13 1. What feature of heaps allows them to be efficiently implemented using a partially filled array? A. Heaps are binary search trees. B. Heaps are complete binary trees. C. Heaps are full binary trees. D. Heaps contain only integer data. 2. What is the best definition of a collision in a hash table? A. Two entries are identical except for their keys. B. Two entries with different data have the exact same key. C. Two entries with different keys have the same exact hash value. D. Two entries with the exact same key have different hash values. 3. What is the worst-case time for quicksort to sort an array of n elements? A. O(log n) B. O(n) C. O(n log n) D. O(n²) 4. Mergesort makes two recursive calls. Which statement is true after these recursive calls finish but before the merge step? A. The array elements form a heap. B. Elements in each half of the array are sorted amongst themselves. C. Elements in the first half of the array are less than or equal to elements in the secom half of the array. D. None of the above. 5. Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin(). Which of the following is the updated min heap? A. 4,6,7,5 B. 6,7,5,4 C. 4,5,6,7 D. 4,6,5,7 1