UTpaper

Free mock tests & test series

Question 58Asked in BEL PE Computer Science, 20 Dec 2025 (5:00 PM)

Which of the following Big-O notations represents the best time complexity?

  1. AO(1)
  2. BO(n log n)
  3. CO(n²)
  4. DO(n)
Show answerHide answer

Correct answer: (A) O(1)

From BEL PE Computer Science PYQ, 20 Dec 2025 (5:00 PM)

This is question 58 of BEL PE Computer Science PYQ, 20 Dec 2025 (5:00 PM). 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.