231 views

1 Answer

0 votes
0 votes
  1. If C = 1 or 2 then n>=1  5n+3= Big Omega ( C2n)
  2. If C = 3 then n=1,2,3  5n+3= Big Omega ( C2n)
  3. If C =4 then n=1     5n+3= Big Omega ( C2n)
  4. If C> 5 condition then C2n = Big Omega (5n+3 ) means C2n greater than 5n+3
edited by

Related questions

0 votes
0 votes
1 answer
1
saumya mishra asked Jun 26, 2018
336 views
How to prove these type of questions???
0 votes
0 votes
1 answer
2
Tuhin Dutta asked Dec 12, 2017
693 views
In the context of merge sort, which of the following are true?$1.\ T(n)\ =\ o(n^2)\\ 2.\ T(n)\ =\ O(n^2)\\3.\ T(n)\ =\ \omega(n)\\4.\ T(n)\ =\ \Omega(n) $
0 votes
0 votes
1 answer
3
shivanisrivarshini asked Oct 7, 2016
490 views
If f(n)=O(g(n)) for f,g are non decreasing functions ,thenf(n)*log2(f(n)c) =O(g(n) * log2g(n)) , c is power of f(n) isa)Always trueb) Neverc) Sometimes true , sometimes ...
1 votes
1 votes
2 answers
4
shreshtha5 asked Dec 3, 2015
672 views
Q). Consider the following functions$f_1 = n^{\frac{4}{3}}$$f_2=2^{2^n}$$f_3= 2^{n^2}$$f_4= n!$$f_5=2^n$Which of the following is true?A). $f_1$ is $\Omega(f_2)$B). $f_2$...