GATE CS 2023 (Forenoon) — Question 29

AlgorithmsAsymptotic Analysis (O, Omega, Theta Complexities)MSQ1 markEasy

Let \( f \) and \( g \) be functions of natural numbers given by \( f(n) = n \) and \( g(n) = n^2 \). Which of the following statements is/are TRUE?
  1. A
    \( f \in O(g) \)
  2. B
    \( f \in \Omega(g) \)
  3. C
    \( f \in o(g) \)
  4. D
    \( f \in \Theta(g) \)
Practise the full 2023-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