Q1. What is order of resultant heap after merging two tree of order k?.
A. 2*k.
B. k+1.
C. k*k.
D. k+logk.
Answer= k+1
Q2. Time taken in decreasing the node value in a binomial heap is.
A. O(n).
B. O(1).
C. O(logn).
D. O(nlogn).
Answer= O(logn)
Q3. Which of these operations have same complexities?.
A. Insertion, find_min.
B. Find_min, union.
C. Union, Insertion.
D. Deletion, Find _max.
Answer= Union, Insertion
Q4. The Statement "Fibonacci heap has better amortized running time in compare to a binomial heap"..
A. TRUE.
B. FALSE.
C. Nothing can be said.
D. None of the mentioned.
Answer= TRUE
Q5. Given a heap of n nodes.The maximum number of tree for building the heap is..
A. n.
B. n-1.
C. n/2.
D. logn.
Answer= n
Q6. Choose the option with function having same complexity for a fibonacci heap..
A. Insertion, Union.
B. Insertion, Deletion.
C. extract_min, insertion.
D. Union, delete.
Answer= Insertion, Union
Q7. Which operation cannot be directly performed in a d-heap?.
A. insert.
B. delete.
C. find.
D. create.
Answer= find
Q8. Which operation is not efficiently performed in a d-heap?.
A. insert.
B. delete.
C. find.
D. merge.
Answer= merge
Q9. What is the run time efficiency of an insertion algorithm in d-heap?.
A. O(N).
B. O(log N).
C. O(logd N).
D. O(Nd).
Answer= O(logd N)
Q10. How many comparisons will occur while performing a delete-min operation?.
A. "d".
B. "d-1".
C. "d+1".
D. "1".
Answer= "d-1"
Q11. How many basic operations can be performed in a d-heap?.
A. 1.
B. 2.
C. 3.
D. 4.
Answer= 2
Q12. What is the run time efficiency of delete-min operation?.
A. O(log N).
B. O(logd N).
C. O(d logd N).
D. O(d).
Answer= O(d logd N)
Q13. Multiplication and division to find children and parents cannot be implemented in a d-heap..
A. TRUE.
B. FALSE.
C. Nothing can be said.
D. None of the mentioned.
Answer= FALSE
Q14. How many secondary operations are performed in a d-heap?.
A. 1.
B. 2.
C. 3.
D. 4.
Answer= 4
Q15. On which data structure is a d-ary heap based?.
A. stack.
B. queue.
C. linked list.
D. priority queue.
Answer= priority queue
Q16. Which property should ternary heap hold for execution?.
A. Associative.
B. Commutative.
C. Tree.
D. Heap.
Answer= Heap
Q17. Should leaves in ternary heap be distributed from left to right..
A. TRUE.
B. FALSE.
C. Nothing Can be said.
D. None of the mentioned.
Answer= TRUE