Back to the 2022 paper
Similar questions
Design & Analysis of AlgorithmsA priority queue is implemented as a Max-heap. Initially it has 5 elements. The level order traversal of the heap is 10, 8, 5, 3, 2. Two new elements '1' and '7' are inserted into the heap in that order. The level order traversal of the heap after the insertion of the elements is: - (i) 10, 8, 7, 5, 3, 2, 1 - (ii) 10, 8, 7, 2, 3, 1, 5 - (iii) 10, 8, 7, 1, 2, 3, 5 - (iv) 10, 8, 7, 3, 2, 1, 520222mDesign & Analysis of AlgorithmsWorst-case complexity of heap sort is - - (i) O(\log n) - (ii) O(n^2) - (iii) O(n \log n) - (iv) O(n)20242mDesign & Analysis of AlgorithmsConstruct the max heap for the following: 35 33 42 10 14 19 27 44 26 3120247mDesign & Analysis of AlgorithmsWrite short notes on: Heap creation technique20237m