Answer 9: O(logN)
The root of min heap is the inimum element which can be deleted in O(1) but then heapify needs to be performed which has O(logN) complexity.
Answer 10: O(d)
Answer 11: Quadratic probing
Answer 12: O(nlogn)
These are fact based questions.
C++ Question 9 5 pts Deleting the minimum element in a min-heap of N elements takes...
vas Х Question 1 5 Secondary clustering in a hash table occurs when using Separate chaining Double hashing Linear probing Quadratic probing Question 2 5 pt Rehashing occurs when a hash table becomes too full and we must migrate to a larger table. If we have N elements, and our new table size is M. what is the Big O time of rehashing? O(M) ON+M) ON) O(Mlog N) Question 3 5 pts When sorting n records. Merge Sort has worst-case...
C++ Question 5 5 pts In a min-heap of N elements, if we want to find the max element, we have to search all the leaves. What is the big-o running time of findMax? O(N^2) Oſlog N) O(N) OIN log N) Question 6 5 pts An AVL tree is a Binary Search Tree that has the following additional property for every node in the tree, the height of the left and right subtrees is the same none of the above...
C++ Question 1 5 pts A binary heap's structure is an AVL tree a complete binary tree a particular case of binary search tree a sparse tree Question 2 5 pts When using a hash table with quadratic probing, and the table size is prime, then a new element can always be inserted if the table is at least half empty the table is full the table is at least half full the table is larger than any data value...
anvas A Question 7 5 pts A binary heap's structure is an AVL tree a particular case of binary search tree a complete binary tree a sparse tree Question 8 5 pts The time taken to find an element in an AVL tree of depth dis Old) Ollogd Old2) Odlog d) Question 9 5 pts Deleting the minimum element in a min-heap of Nelements takes in average case Ollog N ON 011 OIN log N
anvas A Question 7 5 pts A binary heap's structure is an AVL tree a particular case of binary search tree a complete binary tree a sparse tree Question 8 5 pts The time taken to find an element in an AVL tree of depth dis Old) Ollogd Old2) Odlog d) Question 9 5 pts Deleting the minimum element in a min-heap of Nelements takes in average case Ollog N ON 011 OIN log N
3. N elements are inserted from a min-heap with N elements. The total running time is: a) O(N2) worst case b) O(logN) worst case c) O(N) worst case d) None of these
Canvas → XCO Question 4 5 pts When using a hash table with quadratic probing, and the table size is prime, then a new element can always be inserted if the table is at least half empty the table is at least half full the table is full the table is larger than any data value Question 5 5 pts The general strategy of inorder traversal is: process the left subtree, then process the current node and finally process the...
Canvas →XC 6 D Question 10 5 pts When sorting n records, Quicksort has worst-case cost On) On 2) On logn) Olm Question 11 5 pts In the worst case, the very best that a comparison based sorting algorithm can do when sorting n records is On 2) Allog in! (n) (login) Question 12 5 pts An AVL tree is a Binary Search Tree that has the following additional property none of the above for every node in the tree....
Q5 Match the following operations to their corresponding worst case time complexities Operations Finding the nert larger item in a Hash Table Time Complexities од) O (log n) O(n) O(n log n) O(n2) o(n3) O(n + m) O(m logn) O((n +m) log n) O(n2+nm) Trying to remove a non-eristing item from a Hash Table 2 3Finding the previous smaller item in a possibly unbalanced BST Updating a previous value into a new value in an AVL Tree Sorting m edges...
Assume a hash table is implemented using chaining with buckets implemented using sorted linked lists. What's the worst-case time complexity of inserting a data item? (n is the size of data) Oin None of these Oina) O(nLogin) O 0(1) D Question 22 2 pts Assume a hash table is implemented using chaining with buckets implemented using binary search trees. What's the average-case time complexity of searching for a data item? Assume the size of data, n, is not much larger...