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

Question

Computer Science · Algorithms

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Share:

Correct answer

It represents the asymptotic upper bound of an algorithm's runtime.

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Chapter Practice

Want more practice questions on Algorithms?

Solve complete topic-wise tests with detailed solutions on GkGet.

Recommended practice questions in Computer Science · Algorithms

Which movement aimed to promote Khadi, a hand-spun and handwoven cloth native to India?

Who were prominent leaders associated with the initial phase of the Telangana Rebellion (1946-1951) against the Nizam's rule and feudal landlords?

What was the immediate trigger for the Revolt of 1857?

Answer 1

It measures the physical execution time of an algorithm in seconds.

Answer 2

It represents the exact average-case runtime of an algorithm.

Answer 3

It represents the asymptotic upper bound of an algorithm's runtime.

Answer 4

It represents the tightest lower bound of an algorithm's runtime.

Related Practice Questions