Aspire Faculty ID #18762 · Topic: UGC NET Computer Science Sep 2022 (Paper II) · Just now
UGC NET Computer Science Sep 2022 (Paper II)

Assume that $f(n)$ and $g(n)$ are asymptotically positive. Which of the following is correct?

Solution

If $f(n)=O(g(n))$ and $g(n)=O(h(n))$, then by transitivity:

$f(n)=O(h(n))$

But option says:

$f(n)=\omega(h(n))$

So, option (a) is incorrect.

Check option (b):

If $f(n)=\Omega(g(n))$ and $g(n)=\Omega(h(n))$, then:

$f(n)=\Omega(h(n))$

But option says:

$f(n)=O(h(n))$

So, option (b) is incorrect.

Check option (c):

If $f(n)=o(g(n))$, then $f(n)$ grows strictly slower than $g(n)$.

If $g(n)=o(h(n))$, then $g(n)$ grows strictly slower than $h(n)$.

Therefore, $f(n)$ also grows strictly slower than $h(n)$.

So,

$f(n)=o(h(n))$

Thus, option (c) is correct.

Check option (d):

If $f(n)=\omega(g(n))$ and $g(n)=\omega(h(n))$, then:

$f(n)=\omega(h(n))$

Since $\omega(h(n))$ is stronger than $\Omega(h(n))$, option (d) is also mathematically correct.

Therefore, mathematically both option (c) and option (d) are correct.

If the exam expects only one answer, then the question has ambiguity.

Previous 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Nearest first

Next 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Ascending by ID
1
The solution of the recurrence relation $T(n)=3T\left(\frac{n}{4}\right)+n\log n$ is
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
The number of nodes of height $h$ in any $n$-element heap is atmost:
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
Consider a B-tree of height $h$ minimum degree $t\ge 2$ that contains any $n$-key, where $n\ge 1$. Which of the followi…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
Which of the following algorithm design approach is used in Quick sort algorithm?
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
Consider the hash table of size $11$ that uses open addressing with linear probing. Let $h(k)=k\mod 11$ be the hash fun…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
Consider the traversal of a treePreorder $\to ABCEIFJDGHKL$Inorder $\to EICFJBGDKHLA$Which of the following is correct …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
How many rotations are required during the construction of an AVL tree if the following elements are to be added in the…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Consider the following two lists:List IList II(A) Stack overflow(I) Software Interrupt(B) Timer(II) Internal interrupt(…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Let $R(ABCDEFGH)$ be a relation schema and $F$ be the set of dependencies$F=\{A\to B,\ ABCD\to E,\ EF\to G,\ EF\to H,\ …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
A trigger is
Topic: UGC NET Computer Science Sep 2022 (Paper II)
Ask Your Question or Put Your Review.

loading...