This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Min/Max Heap”. 1. Descending priority queue can be implemented using ______ a) max heap b) min heap c) min-max heap d) trie 2. Min heap can be used to implement selection sort. a) True b) False 3. Which of the … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Skew Heap”. 1. ___________ is a self-adjusting version of a leftist heap. a) Rightist heap b) Skew heap c) d-heap d) Binary heap 2. The worst case running time of all operations in a skew heap is given as? a) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Leftlist Heap”. 1. Pointer manipulation is generally more time-consuming than multiplication and division. a) true b) false 2. How many properties does a leftist heap support? a) 1 b) 2 c) 3 d) 4 3. In a leftist heap, the … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Pairing Heap”. 1. What is the reason for the efficiency of a pairing heap? a) simplicity b) time-efficient c) space-efficient d) advanced 2. How is a pairing heap represented? a) binary tree b) fibonacci tree c) heap ordered tree d) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Ternary Heap – 2”. 1. What is the time complexity for inserting a new item in a ternary heap of n elements? a) O (log n/ log 3) b) O (n!) c) O (n) d) O (1) 2. Is decrease … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Ternary Heap”. 1. What is the smallest element of the given minimum ternary heap? a) 1 b) 10 c) 18 d) 20 2. What is the highest element of the given maximum ternary heap? a) 31 b) 10 c) 18 … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “D-ary Heap”. 1. d-heap is similar to that of a? a) binary heap b) fibonacci heap c) leftist heap d) treap 2. d-heap is shallower than a binary heap. a) true b) false 3. Which operation cannot be directly performed … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Binomial and Fibonacci Heap”. 1. The main distinguishable characterstic of a binomial heap from a binary heap is that a) it allows union operations very efficiently b) it does not allow union operations that could easily be implemented in binary heap c) … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Weak Heap”. 1. Choose the correct properties of weak-heap. a) Every node has value greater than the value of child node b) Every right child of node has greater value than parent node c) Every left child of node has greater value … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Binary Heap”. 1. What is the space complexity of searching in a heap? a) O(logn) b) O(n) c) O(1) d) O(nlogn) 2. What is the best case complexity in building a heap? a) O(nlogn) b) O(n2) c) O(n*longn *logn) d) O(n) 3. … Read more
