520 views
2 votes
2 votes

Assume f(n) and g(n)  are two functions such that f (n)=O(g(n))

which of the following always hold

F(n) = O (f(n)2)

F(n) = Ω (f(n)2)

G(n) = O (f(n)2)

G(n) = Ω (g(n))

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
srestha asked May 19, 2019
642 views
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...
0 votes
0 votes
0 answers
2
eyeamgj asked Aug 30, 2018
278 views
https://gateoverflow.in/43600/gate1992-07bhow can we sovle recurrence relation if recurence relation not exists ??we can compute the value and tym complexity??
0 votes
0 votes
0 answers
3
eyeamgj asked Aug 30, 2018
196 views
https://gateoverflow.in/27194/tifr2014-b-9CAN ANY ONE GIVE AN EXAMPLE BY TAKING SOME ELEMENTS SAY 14 ELEMENTS AND PLEASE SHOW HOW 2ND AND 3RD MINIMUM ARE RETRIEVING USING...
0 votes
0 votes
1 answer
4
eyeamgj asked Jun 24, 2018
410 views
consider the following c program A(n){if(n<=1)return(n2 +n+1)elsereturn(5A(n/2)+3A(n/2)+MA(n))}where MA(n) has complexity O(n2).1.what is the recurrence relation for valu...