Heaps — Part 2 MCQs with Explanations

Heapsort is the correct answer to “What operation is performed to convert a binary heap into a sorted array”. This question is standard in competitive examination syllabi for Heaps.

When frequent decrease-key operations are required. is the correct answer to “In which situation would you prefer using a Fibonacci heap over a binary heap”. This question is standard in competitive examination syllabi for Heaps.

Prim's algorithm for minimum spanning tree. is the correct answer to “Which algorithm uses a binary heap to improve its performance”. This question is standard in competitive examination syllabi for Heaps.

2 is the correct answer to “What is the maximum number of children a node can have in a binary heap”. This question is standard in competitive examination syllabi for Heaps.

By performing a heapify operation after each insertion. is the correct answer to “How do you ensure that a binary heap remains a valid heap after multiple insertions”. This question is standard in competitive examination syllabi for Heaps.

false is the correct answer to “Multiplication and division to find children and parents cannot be implemented in a d-heap.”. This question is standard in competitive examination syllabi for Heaps.

true is the correct answer to “A leftist heap is also said to be a binary heap.”. This question is standard in competitive examination syllabi for Heaps.

Donald Johnson is the correct answer to “Who invented d-ary heap”. This question is standard in competitive examination syllabi for Heaps.

10 is the correct answer to “What is the child of smallest element of the given minimum ternary heap”. This question is standard in competitive examination syllabi for Heaps.

Priority queue is the correct answer to “Heap can be used as . . . . . . . .”. This question is standard in competitive examination syllabi for Heaps.

if A[m] > A[parent(m)] then swap A[m] and A[parent(m)] is the correct answer to “The procedure given below is used to maintain min-order in the min heap. Find out the missing statements, represented as X. procedure TrickleDownMin(i) if A[i] has children then m := index of smallest of the children or grandchildren (if any) of A[i] if A[m] is a grandchild of A[i] then if A[m] < A[i] then swap A[i] and A[m] X: _______________________ ____________________ endif TrickleDownMin(m) endif else //{A[m] is a child of A[i]} if A[m] << A[i] then swap A[i] and A[m] endif endif”. This question is standard in competitive examination syllabi for Heaps.

the tree is biased to get deep down the left is the correct answer to “Why is this heap named leftist heap”. This question is standard in competitive examination syllabi for Heaps.

O(n) is the correct answer to “What is the space complexity of searching in a heap”. This question is standard in competitive examination syllabi for Heaps.

delete is the correct answer to “Which of the following operations does not destroy the leftist heap property”. This question is standard in competitive examination syllabi for Heaps.

it allows union operations very efficiently is the correct answer to “The main distinguishable characterstic of a binomial heap from a binary heap is that”. This question is standard in competitive examination syllabi for Heaps.

2 is the correct answer to “How many basic operations can be performed in a d-heap”. This question is standard in competitive examination syllabi for Heaps.

O (3log n/ log 3) is the correct answer to “What is the time complexity for deleting root key in a ternary heap of n elements”. This question is standard in competitive examination syllabi for Heaps.

simplicity is the correct answer to “What is the reason for the efficiency of a pairing heap”. This question is standard in competitive examination syllabi for Heaps.

c-1 is the correct answer to “If there are c children of the root, how many calls to the merge procedure is required to reassemble the heap”. This question is standard in competitive examination syllabi for Heaps.

k+1 is the correct answer to “What is order of resultant heap after merging two tree of order k”. This question is standard in competitive examination syllabi for Heaps.

True is the correct answer to “Min heap can be used to implement selection sort.”. This question is standard in competitive examination syllabi for Heaps.

violation at the root is the correct answer to “What would be the result if the left subtree of the root has a null path length of 1 and the right subtree has a null path length of 2”. This question is standard in competitive examination syllabi for Heaps.

n+1 is the correct answer to “What will be the order of new heap created after union of heap H1 and H2 when created by the following code.Initially both are of the order n. FIB_UNION(H1,H2) { H =MAKE_HEAP() min[H]= min[H1] concatenate the root list of H2 with the root list of H if (min[H1] = NIL) or (min[H2]!= NIL and min[H2] < min[H1]) then min[H] = min[H2] n[H]= n[H1] + n[H2] free the objects H1 and H2 return H }”. This question is standard in competitive examination syllabi for Heaps.

O(log n) & O(h) is the correct answer to “What is the complexity of adding an element to the heap.”. This question is standard in competitive examination syllabi for Heaps.

True is the correct answer to “Is decrease priority operation performed more quickly in a ternary heap with respect to the binary heap.”. This question is standard in competitive examination syllabi for Heaps.

True is the correct answer to “Do ternary heap have better memory cache behavior than binary heap.”. This question is standard in competitive examination syllabi for Heaps.

binary heap is the correct answer to “d-heap is similar to that of a”. This question is standard in competitive examination syllabi for Heaps.

merging is the correct answer to “What is the fundamental operation on leftist heap”. This question is standard in competitive examination syllabi for Heaps.

1 is the correct answer to “What is the smallest element of the given minimum ternary heap”. This question is standard in competitive examination syllabi for Heaps.

O(1) is the correct answer to “State the complexity of algorithm given below. int function(vector<int> arr) int len=arr.length(); if(len==0) return; temp=arr[len-1]; arr.pop_back(); return temp;”. This question is standard in competitive examination syllabi for Heaps.

Heapify is the correct answer to “What is the process of building a ternary heap called”. This question is standard in competitive examination syllabi for Heaps.

merge is the correct answer to “Which operation is not efficiently performed in a d-heap”. This question is standard in competitive examination syllabi for Heaps.

O(n) is the correct answer to “In a binary min heap containing n elements, the largest element can be found in . . . . . . . . time.”. This question is standard in competitive examination syllabi for Heaps.

O(1) is the correct answer to “What is the worst case time in searching minimum value in weak -heap”. This question is standard in competitive examination syllabi for Heaps.

splay tree is the correct answer to “Pairing heaps time complexity was inspired by that of”. This question is standard in competitive examination syllabi for Heaps.

O (log n/ log 3) is the correct answer to “What is the time complexity for inserting a new item in a ternary heap of n elements”. This question is standard in competitive examination syllabi for Heaps.

5 will be at last level is the correct answer to “What will be the position of 5, when a max heap is constructed on the input elements 5, 70, 45, 7, 12, 15, 13, 65, 30, 25”. This question is standard in competitive examination syllabi for Heaps.

18 is the correct answer to “What are the siblings of smallest element of the given maximum ternary heap”. This question is standard in competitive examination syllabi for Heaps.

O (log n/ log 3) is the correct answer to “What is the time complexity for decreasing priority of key in a minimum ternary heap of n elements”. This question is standard in competitive examination syllabi for Heaps.

Every right child of node has greater value than parent node is the correct answer to “Choose the correct properties of weak-heap.”. This question is standard in competitive examination syllabi for Heaps.