530 views

1 Answer

Best answer
1 votes
1 votes

T1(n)=O(f(n))   => T1(n) < c1 * f(n)  where c1 is +ve constant (from Big O Def)

T2(n)=O(f(n))  => T2(n) < c2 * f(n)  where c2 is +ve constant (from Big O Def)

a] True

Since T1(n) + T2(n) < (c1+c2) * f(n), So we can say T1(n) + T2(n) = O(f(n))

b] False

Let T1(n) = n2 and T2(n) = n  and f(n) = n3

Clearly T1(n) >T2(n),So T1(n) = O(T2(n)) is not possible.

c] False

Let T1(n) = n and T2(n) = n and f(n) = n3

Clearly T1(n) < T2(n),So T1(n) = ώ(T2(n))  is not possible.

d] False

Take the same assumptions as above then

You can say, T1(n) < C1 * T2(n) for C1 = 1  but

T1(n) > C2 *T2(n) is not possible for any positive constant

Then T1(n)= Θ(T2(n)) is not possible.

Answer:

Related questions

0 votes
0 votes
0 answers
1
1 votes
1 votes
1 answer
2
rude asked Jun 1, 2016
514 views
I was surfing internet and I got this beautiful Problem, I thought i should post here.
0 votes
0 votes
3 answers
3
piyushkr asked Dec 31, 2015
1,374 views
(logn)1/2=O(loglogn)
1 votes
1 votes
2 answers
4
Banti Arya asked Dec 5, 2015
515 views
i geeting ans 1 and 2 are true but ans given only 2 is true explain it