50+ Binomial and Fibonacci Heap (Data Structure) MCQs with FREE PDF

We have the best collection of Binomial and Fibonacci Heap (Data Structure) MCQs and answer with FREE PDF. These Binomial and Fibonacci Heap (Data Structure) MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

Binomial and Fibonacci Heap (Data Structure) MCQs

a) 2*k

b) k+1

c) k*k

d) k+logk

a) O(n)

b) O(1)

c) O(logn)

d) O(nlogn)

3. What does this pseudo_code return?

``````	int myfun(heap_arr[])
{
int mini=INF;
for(int i=0;i<tot_node;i++)
mini=min(mini,heap_arr)
return mini;
}
``````

a) Last added element to heap

b) First element added to heap

c) Root of the heap

d) Leftmost node of the heap

4. Which of these operations have same complexities?

a) Insertion, find_min

b) Find_min, union

c) Union, Insertion

d) Deletion, Find _max

a) True

b) False

a) n

b) n-1

c) n/2

d) logn

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

8. 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) the heap structure is not similar to complete binary tree

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

Answer: it allows union operations very efficiently

a) logn

b) n

c) nlogn

d) n/2