Register

Karumanchi

980 views
0 0 votes
f(n)=$2^n$

g(n)=n!

h(n)=$n^{logn}$
 

which one is true?

A) f(n)=O(g(n)) and g(n)=O(h(n))

B) f(n)=$\Omega(g(n)))$ and g(n)=O(h(n))
C) g(n)=O(f(n)) and h(n)=O(f(n))

D) h(n)=O(f(n)) and g(n)=$\Omega(f(n))$

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Rank of the indexNext → · operating system que...
← Previous in category · Please Explain also....Next in category → · algo questions
Position:
Show:

Related questions

0 0 votes
2 answers 2 answers
2.0k
2.0k views
aditi19 asked Nov 4, 2018
2,040 views
Karumanchi
0 0 votes
1 1 answer
2.2k
2.2k views
aditi19 asked Oct 31, 2018
2,150 views
Karumanchi
what is the time complexity offunction(int n){ if(n<=1) return; for(int i=1; i<n; i++) { printf("*"); } ...
1 1 vote
2 2 answers
2.1k
2.1k views
aditi19 asked Nov 20, 2018
2,094 views
Karumanchi
There is a singly linked list. We have a pointer to a particular node(it is not tail node). what is the time and space complexity required to delete this node?my approach...
0 0 votes
0 0 answers
1.6k
1.6k views
Lakshman Bhaiya asked Oct 17, 2018
1,634 views
Linked List Data Structures And Algorithms Made Easy By Narasimha Karumanchi
Suppose there are two singly linked lists both of which intersect at some pointand become a single linked list. The head or start pointers of both the lists are known, bu...