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
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
- Which of the following statements most accurately differentiates software verification from software validation in the context of software engineering practices?
- Which of the following issues and computational considerations are commonly encountered when designing and implementing data-mining processes on large-scale datasets?
- Why is the use of botnets considered ethically problematic?
- Given a ≡ b (mod n) and c ≡ d (mod n), which statement is/are correct?
- Which of the following techniques is most commonly employed to systematically examine and evaluate a Software Requirements Specification (SRS) for correctness, completeness, and consistency?
- Which of the following operations does NOT constitute a conventional data-cleaning technique that is used to handle missing values, inconsistencies and inaccuracies in datasets during the data preprocessing stage?
- IT security risk management aims to balance the cost of security controls against which of the following?
- In combinatorics and finite-set cardinality analysis, which of the following best describes the principal purpose of the inclusion–exclusion principle when determining the number of elements belonging to the union of two or more overlapping sets, particularly when their individual cardinalities and intersection sizes are known?