Heap MCQ

Test your knowledge with important Heap MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Heap MCQs at Bissoy

• How many types are there in binary heaps?
  ক

  1

  খ

  2

  গ

  3

  ঘ

  4
• In what form does the STL provides heap?
  ক

  queue

  খ

  list

  গ

  vector

  ঘ

  priority_queue
• How to protect the heap from affecting the memory?
  ক

  Avoid using pointers for associating two data structures

  খ

  Embed pointed child objects into the parent object

  গ

  Allocate objects in chunks

  ঘ

  All of the mentioned
• Which operator is used to compare the elements in heap?
  ক

  >>

  খ

  comp

  গ

  <

  ঘ

  Both comp &<
• Which value is pointed out first in heap?
  ক

  Lowest value

  খ

  Highest value

  গ

  First value

  ঘ

  Third value
• What is meant by heap?
  ক

  Used for fast retrieval of elements

  খ

  Used for organising the elements

  গ

  Used for fast retrieval & organising the elements

  ঘ

  Used for deleting the elements
• What is the use of is_heap_until() function?
  ক

  Returns the iterator of the last element of the sequence always

  খ

  Returns the iterator to the position from where the sequence is a heap

  গ

  Returns the iterator of the position till that the sequence is a heap

  ঘ

  Returns the iterator of the first element of the sequence
• Which function is used to check whether a given sequence is heap or not?
  ক

  sort_heap()

  খ

  is_heap()

  গ

  is_heap_until()

  ঘ

  check_heap()
• What is the use of sort_heap() function in heap?
  ক

  To sort the elements in the heap into descending order

  খ

  To sort the elements in the heap into ascending order

  গ

  To sort the first half of the heap

  ঘ

  To sort the second half of the heap
• Which header file is required to use heap in your program?
  ক

  <heap>

  খ

  <algorithm>

  গ

  <vector>

  ঘ

  <map>
• Elements in STL heap are removed in ________________________
  ক

  decreasing order

  খ

  increasing order

  গ

  alternate i.e. once max element then min element

  ঘ

  input order
• Which function is used to insert an element into heap?
  ক

  push_back()

  খ

  push_heap()

  গ

  pop_back()

  ঘ

  pop_heap()
• What is the use of front() function in heap?
  ক

  Returns the element closest to the median of a sequence

  খ

  Returns the last element of the heap

  গ

  Returns the first element of the heap

  ঘ

  Returns the element closest to mean of a sequence
• Which function is used to construct heap from given sequence of numbers?
  ক

  create_heap()

  খ

  make_heap()

  গ

  construct_heap()

  ঘ

  start_heap()
• Which type of heap is implemented in STL heap?
  ক

  max heap

  খ

  min heap

  গ

  middle heap

  ঘ

  close heap
• An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
  ক

  O(n*n*logn)

  খ

  O(n*logn)

  গ

  O(n*n)

  ঘ

  O(n *logn *logn)
• If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value will be at leaf nodes of the right subtree of the heap.
  ক

  15 and 1

  খ

  25 and 1

  গ

  3 and 1

  ঘ

  2 and 3
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
  ক

  2

  খ

  100

  গ

  17

  ঘ

  3
• Heap can be used as ________________
  ক

  Priority queue

  খ

  Stack

  গ

  A decreasing order array

  ঘ

  Normal Array
• The worst case complexity of deleting any arbitrary node value element from heap is __________
  ক

  O(logn)

  খ

  O(n)

  গ

  O(nlogn)

  ঘ

  O(n2)
• What is the complexity of adding an element to the heap.
  ক

  O(log n)

  খ

  O(h)

  গ

  O(log n) & O(h)

  ঘ

  O(n)
• Heap exhibits the property of a binary tree?
  ক

  True

  খ

  False
• In a max-heap, element with the greatest key is always in the which node?
  ক

  Leaf node

  খ

  First node of left sub tree

  গ

  root node

  ঘ

  First node of right sub tree