GateAI
Asymptotic Analysis

GATE CSE 2023 · Q29

MSQ1 markEasy

Time

Let ff and gg be functions of natural numbers given by f(n)=nf(n) = n and g(n)=n2g(n) = n^2. Which of the following statements is/are TRUE?

Select all that applyOne or more correct

Pick every correct option

Solution

Step-by-step verified solution

Official answer: A) f ∈ O(g); C) f ∈ o(g)

Asymptotic Analysis

We are given the functions f(n)=nf(n) = n and g(n)=n2g(n) = n^2 for n∈Nn \in \mathbb{N}.

To determine the asymptotic relations, consider the limit of their ratio as n→∞n \to \infty:

lim⁡n→∞f(n)g(n)=lim⁡n→∞nn2=lim⁡n→∞1n=0\lim_{n \to \infty} \frac{f(n)}{g(n)} = \lim_{n \to \infty} \frac{n}{n^2} = \lim_{n \to \infty} \frac{1}{n} = 0
  • Option A (f∈O(g)f \in O(g)): f(n)∈O(g(n))f(n) \in O(g(n)) means that f(n)≤c⋅g(n)f(n) \le c \cdot g(n) for some constant c>0c > 0 and all sufficiently large nn. Since n≤n2n \le n^2 for all n≥1n \ge 1, this holds (with c=1c = 1). Thus, (A) is TRUE.

  • Option B (f∈Ω(g)f \in \Omega(g)): f(n)∈Ω(g(n))f(n) \in \Omega(g(n)) requires that f(n)≥c⋅g(n)f(n) \ge c \cdot g(n) for some constant c>0c > 0 and all sufficiently large nn. Since lim⁡n→∞f(n)g(n)=0\lim_{n \to \infty} \frac{f(n)}{g(n)} = 0, f(n)f(n) grows strictly slower than g(n)g(n), so this does not hold. Thus, (B) is FALSE.

  • Option C (f∈o(g)f \in o(g)): f(n)∈o(g(n))f(n) \in o(g(n)) (little-o notation) is defined by lim⁡n→∞f(n)g(n)=0\lim_{n \to \infty} \frac{f(n)}{g(n)} = 0. Since this limit evaluates to 00, (C) is TRUE.

  • Option D (f∈Θ(g)f \in \Theta(g)): f(n)∈Θ(g(n))f(n) \in \Theta(g(n)) requires both f∈O(g)f \in O(g) and f∈Ω(g)f \in \Omega(g). Since f∉Ω(g)f \notin \Omega(g), (D) is FALSE.

Hence, the correct statements are A and C.

Try the question first, then check your work.

Think the official key or this write-up is wrong?

Report error or challenge

Examiner trap

The misconception this question tests

This Asymptotic Analysis previous year question is Q29 of the GATE CSE 2023 paper. Find more GATE CSE PYQs on Asymptotic Analysis in Algorithms, or browse all GATE CSE PYQs.

Free diagnostic

Where do you stand for GATE?

Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Asymptotic Analysis PYQs now with no account.

One GATE CSE PYQ every morning

An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.

Asymptotic Analysis in GATE CSE

Asymptotic Analysis has 31 GATE CSE PYQs across 19 papers from 2011 to 2026. 2 of them are 1-mark MSQs like this one, and GATE CSE 2023 has 2.

How GATE tests Asymptotic Analysis

More from GATE CSE 2023

Share this solution

A plain-text card for WhatsApp or Telegram study groups.

GateAI solution cardGATE CSE 2023 · Q29 · MSQ

Let f and g be functions of natural numbers given by f(n) = n and g(n) = n2. Which of the following statements is/are TRUE?

Topic-wise GATE CS PYQs with verified steps

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.