Question 1 : Given a heap of n nodes.The maximum number of tree for building the heap is.
1. n
2. n-1
3. n/2
4. logn
View Answer   Discuss with Members

Question 2 : What is the run time efficiency of an insertion algorithm in d-heap?
1. O(N)
2. O(log N)
3. O(log_d N)
4. O(N^d)
View Answer   Discuss with Members

Question 3 : The leaf node for a heap of height h will be at which position.
1. h
2. h-1
3. h or h-1
4. None of the mentioned
View Answer   Discuss with Members

Question 4 : Descending priority queue can be implemented using ______
1. max heap
2. min heap
3. min-max heap
4. trie
View Answer   Discuss with Members

Question 5 : What is the other name of weak heap?
1. Min-heap
2. Max-heap
3. Relaxed -heap
4. Leonardo heap
View Answer   Discuss with Members

Question 6 : Which of the following methods is the best choice for complex applications?
1. binary heap
2. d-heap
3. treap
4. pairing heap
View Answer   Discuss with Members

Question 7 : Which property should ternary heap hold for execution?
1. Associative
2. Commutative
3. Tree
4. Heap
View Answer   Discuss with Members

Question 8 : Time taken in decreasing the node value in a binomial heap is
1. O(n)
2. O(1)
3. O(logn)
4. O(nlogn)
View Answer   Discuss with Members

Question 9 : What is the time complexity for creating a ternary heap using swapping?
1. O (log n/ log 3)
2. O (n!)
3. O (n)
4. O (1)
View Answer   Discuss with Members

Question 10 : The main distinguishable characterstic of a binomial heap from a binary heap is that
1. it allows union operations very efficiently
2. it does not allow union operations that could easily be implemented in binary heap
3. the heap structure is not similar to complete binary tree
4. the location of child node is not fixed i.e child nodes could be at level (h-2) or (h-3), where h is height of heap and h>4
View Answer   Discuss with Members