UTpaper

Free mock tests & test series

Question 97Asked in BPSC TRE 3.0 (2024) Computer Science Class 11-12

Which of the following statements is true about Big-O notation?

  1. AIt represents the lower bound of an algorithm’s runtime.
  2. BIt represents the upper bound of an algorithm’s runtime
  3. CIt represents the average runtime of an algorithm.
  4. DMore than one of the above
  5. ENone of the above
Show answerHide answer

Correct answer: (B) It represents the upper bound of an algorithm’s runtime

Explanation

Big-O gives an asymptotic upper bound on the growth of an algorithm's running time, usually used for the worst case. Big-Omega gives the lower bound.

From BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper

This is question 97 of BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.