If an algorithm has time complexity T(n) = 3n2 + 5...
Guiding State PSC aspirants since 2016 50,000+ students · 1,000+ final selections Exam Calendar Results Call 9116926003
pscnotes
Pick your state
GPSC Prelims previous year questions

If an algorithm has time complexity T(n) = 3n2 + 5n + 7, then what will be its asymptotic order?

Asked in GPSC ICT Officer, Class-2 2026

  1. O(n)
  2. O(n log n)
  3. O(n2)
  4. O(2n)
Show answer

Answer: C. O(n2)

This previous-year question came without the commission's answer key; the answer was checked by AI. Always confirm with the official key.

More GPSC Prelims previous year questions questions

All 18,593 GPSC Prelims previous year questions questions →