# Binomial, Fibonacci and D-ary Heap MCQs

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.

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).

Q3. Which of these operations have same complexities?.

A. Insertion, find_min.

B. Find_min, union.

C. Union, Insertion.

D. Deletion, Find _max.

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.

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.

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.

Q7. Which operation cannot be directly performed in a d-heap?.

A. insert.

B. delete.

C. find.

D. create.

Q8. Which operation is not efficiently performed in a d-heap?.

A. insert.

B. delete.

C. find.

D. 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).

Q10. How many comparisons will occur while performing a delete-min operation?.

A.  "d".

B.  "d-1".

C.  "d+1".

D.   "1".

Q11. How many basic operations can be performed in a d-heap?.

A. 1.

B. 2.

C. 3.

D. 4.

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).

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.

Q14. How many secondary operations are performed in a d-heap?.

A. 1.

B. 2.

C. 3.

D. 4.

Q15. On which data structure is a d-ary heap based?.

A. stack.

B. queue.

D. priority queue.

Q16. Which property should ternary heap hold for execution?.

A. Associative.

B. Commutative.

C. Tree.

D. Heap.