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
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Heap”. 1. In a max-heap, element with the greatest key is always in the which node? a) Leaf node b) First node of left sub tree c) root node d) First node of right sub tree 2. Heap exhibits the property of … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Expression Tree”. 1. The leaves of an expression tree always contain? a) operators b) operands c) null d) expression 2. A node can have a minimum of one child. a) true b) false 3. What does the other nodes of … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Parse Tree”. 1. Which of the following is correct with respect to a parse tree for a given grammar? a) n parse tree = n leftmost derivation tree = n rightmost derivation tree b) n parse tree = n leftmost derivation tree … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Abstract Syntax Tree”. 1. Which tree traversal technique is used to evaluate the expression represented by syntax tree? a) Pre-order traversal b) In-order traversal c) Post-order traversal d) Breadth first traversal 2. Which pattern is used to evaluate abstract syntax tree? a) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “KD Tree”. 1. In what time can a 2-d tree be constructed? a) O(N) b) O(N log N) c) O(N2) d) O(M log N) 2. Insertion into a 2-d tree is a trivial extension of insertion into a binary search … Read more
