GATE CS 2022 (Forenoon) — Question 11

AlgorithmsAsymptotic Analysis (O, Omega, Theta Complexities)MCQ1 mark · −1/3 if wrongMedium

Which one of the following statements is TRUE for all positive functions \(f(n)\)?
  1. A
    \(f(n^2) = \theta(f(n)^2)\), when \(f(n)\) is a polynomial
  2. B
    \(f(n^2) = o(f(n)^2)\)
  3. C
    \(f(n^2) = O(f(n)^2)\), when \(f(n)\) is an exponential function
  4. D
    \(f(n^2) = \Omega(f(n)^2)\)
Practise the full 2022-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Asymptotic Analysis (O, Omega, Theta Complexities)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group