Question

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?

Choose every correct option
Official answer and solution
Official answer
A and C
From
Official GATE 2023 answer key

Solution

Evaluate the asymptotic ratio lim⁡n→∞f(n)g(n)\lim_{n \to \infty} \frac{f(n)}{g(n)} for f(n)=nf(n) = n and g(n)=n2g(n) = n^2.

We compute the limit of the 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
  • Because the limit is finite (=0= 0), f(n)=O(g(n))f(n) = O(g(n)), so statement (A) is TRUE.
  • Because the limit is strictly 00, f(n)=o(g(n))f(n) = o(g(n)) (little-o), so statement (C) is TRUE.
  • Because the limit is 00, f(n)∉Ω(g(n))f(n) \notin \Omega(g(n)) and f(n)∉Θ(g(n))f(n) \notin \Theta(g(n)). Statements (B) and (D) are FALSE.
Final answer

Options (A, C)

Common trap

Forgetting that f(n)=o(g(n))f(n) = o(g(n)) automatically implies f(n)=O(g(n))f(n) = O(g(n)).

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2023 Computer Science and Information Technology (CS)
Question
29 of 65
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.