Complexity-2 MCQ

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

• Time complexity of the binary search algorithm is constant.
  ক

  True

  খ

  False
• Which algorithm is better for sorting between bubble sort and quicksort?
  ক

  bubble sort

  খ

  quick sort

  গ

  both are equally good

  ঘ

  none of the mentioned
• The time complexity of the linear search is given by ___________
  ক

  O(log2n)

  খ

  O(1)

  গ

  exponential

  ঘ

  none of the mentioned
• The time complexity of binary search is given by ___________
  ক

  constant

  খ

  quardratic

  গ

  exponential

  ঘ

  none of the mentioned
• If for an algorithm time complexity is given by O((3⁄2)n) then complexity will be ___________
  ক

  constant

  খ

  quardratic

  গ

  exponential

  ঘ

  none of the mentioned
• If for an algorithm time complexity is given by O(n2) then complexity will ___________
  ক

  constant

  খ

  quadratic

  গ

  exponential

  ঘ

  none of the mentioned
• If for an algorithm time complexity is given by O(n) then the complexity of it is ___________
  ক

  constant

  খ

  linear

  গ

  exponential

  ঘ

  none of the mentioned
• If for an algorithm time complexity is given by O(log2n) then complexity will be ___________
  ক

  constant

  খ

  polynomial

  গ

  exponential

  ঘ

  none of the mentioned
• If for an algorithm time complexity is given by O(1) then the complexity of it is ____________
  ক

  constant

  খ

  polynomial

  গ

  exponential

  ঘ

  none of the mentioned
• Which is used to measure the Time complexity of an algorithm Big O notation?
  ক

  describes limiting behaviour of the function

  খ

  characterises a function based on growth of function

  গ

  upper bound on growth rate of the function

  ঘ

  all of the mentioned