Register

MadeEasy Test Series: Algorithms - Asymptotic Notations

• edited by
491 views
1 votes
1 votes

• edited by
User Avatar

1 Answer

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

Related questions

752
views
0 answers
2 votes
ashish pal asked Jan 22, 2018
752 views
MadeEasy Test Series 2018: Algorithms - Asymptotic Notations
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 ?
User Avatar
430
views
0 answers
0 votes
charul asked Dec 6, 2017
430 views
MadeEasy Test Series: Algorithms - Asymptotic Notations
User Avatar
1.7k
views
2 answers
0 votes
Anusha Motamarri asked Dec 5, 2016
1,694 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
User Avatar
663
views
1 answers
1 votes
Utk asked Feb 1, 2016
663 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 ... lowest bound n and g(n) has f(n) as upper bound. Answer given is (d.)I am confused about the answer.
User Avatar
Link Copied!