Heaps MCQ question and answer with solution | Data Structure MCQs

Home / Data Structure / Heaps

Section 1 Section 2

41.
What is the time complexity for increasing priority of key in a maximum ternary heap of n elements?

A. O (log n/ log 3)

B. O (n!)

C. O (n)

D. O (1)

Answer & Solution Discuss in Board Save for Later

42.
How many properties does a leftist heap support?

A. 1

B. 2

C. 3

D. 4

Answer & Solution Discuss in Board Save for Later

43.
Min heap is a complete binary tree.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

44.
The Statement "Fibonacci heap has better amortized running time in compare to a binomial heap".

A. True

B. False

Answer & Solution Discuss in Board Save for Later

45.
Which of the following methods is the best choice for complex applications?

A. binary heap

B. d-heap

C. treap

D. pairing heap

Answer & Solution Discuss in Board Save for Later

46.
Is the priority queue abstract data type.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

47.
What is the amortized cost per operation of a skew heap?

A. O(N)

B. O(N log N)

C. O(N²)

D. O(log N)

Answer & Solution Discuss in Board Save for Later

48.
What is the best case complexity in building a heap?

A. O(nlogn)

B. O(n²)

C. O(n*longn *logn)

D. O(n)

Answer & Solution Discuss in Board Save for Later

49.
The following figure is an example for

A. d-heap

B. binary heap

C. leftist heap

D. skew heap

Answer & Solution Discuss in Board Save for Later

50.
What is the time complexity for decreasing priority of key in a maximum ternary heap of n elements?

A. O (log n/ log 3)

B. O (3log n/ log 3)

C. O (n)

D. O (1)

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7

Read More Section(Heaps)

Each Section contains maximum 100 MCQs question on Heaps. To get more questions visit other sections.

Heaps - Section 1