Register

MadeEasy Test Series 2018: Algorithms - Asymptotic Notations

Redirected
• edited by
694 views
2 votes
2 votes

Let f (n) = Ο(n), g(n) = Ω(n) and h(n) = θ(n). Then g(n) + f(n).h(n) is ______

A.) Ω(n)

B.) θ(n2)

C.) Ω(n2)

D.) θ(n)

How to do these type of questions ?

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
charul asked Dec 6, 2017
403 views
MadeEasy Test Series: Algorithms - Asymptotic Notations
User Avatar
0 votes
0 votes
2 answers
3
Anusha Motamarri asked Dec 5, 2016
1,573 views
MadeEasy Test Series: Algorithms - Asymptotic Notations
what if i take f(x) = sinx, g(x)= cosx? these two cant be compared. sinx cant be written as O(cosx) and also cosx cant be written as O(sinx) then B becomes invalid. plz verify
what if i take f(x) = sinx,g(x)= cosx?these two cant be compared.sinx cant be written as O(cosx) and also cosx cant be written as O(sinx)then B becomes invalid.plz verify...
User Avatar
1 votes
1 votes
1 answer
4
Utk asked Feb 1, 2016
623 views
MadeEasy Test Series: Algorithms - Asymptotic Notations
Let $f(n)$ = Ω(n) and g(n) = O(f(n)). Then g(n) = _______ [Assume n>0 ] (a.) Ω(n) (b.) O(n) (c.) θ(n) (d.) Ω(1) According to me, the answer should be (b.) since, f(n) has lowest bound n and g(n) has f(n) as upper bound. Answer given is (d.) I am confused about the answer.
Let $f(n)$ = Ω(n) and g(n) = O(f(n)). Then g(n) = _______ [Assume n>0 ](a.) Ω(n)(b.) O(n)(c.) θ(n)(d.) Ω(1) According to me, the answer should be (b.) since, f(n) has...
User Avatar
Link Copied!