A priority queue is implemented as a Max-heap. Initially it has 5 elem

Back to the 2022 paper

Module 2: Divide and Conquer Paradigm and Heaps

20222m

A 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, 5

Search Google Ask AI

Similar questions

Design & Analysis of AlgorithmsWhat is heap sort? What is the effect of calling MAX-HEAPIFY(A, i) when the element A[i] is larger than its children?20227m Design and Analysis of Algorithms A FIFO Branch-and-Bound strategy is typically implemented using which data structure? (i) Stack (ii) Queue (iii) Priority Queue (iv) Array20252m Design and Analysis of Algorithms In DFS traversal of a graph, which data structure is used to keep track of visited nodes? (i) Queue (ii) Stack (iii) Priority Queue (iv) Heap20242m Operating System______ is a technique of improving the priority of process waiting in queue for CPU allocation: (i) Starvation (ii) Ageing (iii) Revocation (iv) Relocation20222m

PreviousIn the divide and conquer process, breaking the problem into smaller sub-problems is the responsibility of: - (i) divide/break - (ii) sorting/divide - (iii) conquer/solve - (iv) merge/combine NextIf a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called: - (i) dynamic programming - (ii) greedy - (iii) divide and conquer - (iv) recursion