Question

1.)Prove that f(n) = Ω(g(n)), given: F(n) = n2 ; g(n) = n2 + n 2.)Prove...

1.)Prove that f(n) = Ω(g(n)), given: F(n) = n2 ; g(n) = n2 + n

2.)Prove that f(n) = θ(g(n)) for f(n) = n2 + n; g(n) = 5n2

Homework Answers

Answer #1

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

1)

Given f(n)=n^2 and g(n)=n^2+n

So, by definition of big Omega f(n)=Omega(g(n)) iff f(n)>=c*g(n)

So,

n^2>=c*(n^2+n)

So, take c=1/2 and n0=1

So,

We ccan say for c=1/2 and n>=n0=1 f(n)=Omega(g(n))

2)

f(n)=n^2+n and g(n)=5*n^2

So,

First we have to prove

f(n)<=c*g(n)

(n^2+n)<=c*(5*n^2)

c=2/5 and n0=1

So, it holds

f(n)=O(g(n))

Now work for omega

We need to prove

(n^2+n)>=c*(5*n^2)

So, c=1/5 and n0=1

So, we can say

f(n)=Omega(g(n))

Hence by definition of theta

f(n)=theta(g(n))

Kindly revert for any queries

Thanks.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider function f (n) = 4n^2 + 8n + 329. 1. prove that f(n) = Ω(n)...
Consider function f (n) = 4n^2 + 8n + 329. 1. prove that f(n) = Ω(n) 2. prove that f(n) = Ω(n^2)
1. Using the definition of Θ, prove that if f(n) ∈ Θ(g(n)), then g(n) ∈ Θ(f(n)).
1. Using the definition of Θ, prove that if f(n) ∈ Θ(g(n)), then g(n) ∈ Θ(f(n)).
1.Let f and g be two functions such that f(n)/g(n) converges to a positive value less...
1.Let f and g be two functions such that f(n)/g(n) converges to a positive value less than 1 as n tends to infinity. Which of the following is necessarily true? Select one: a. g(n)=Ω(f(n)) b. f(n)=Ω(g(n)) c. f(n)=O(g(n)) d. g(n)=O(f(n)) e. All of the answers 2. If T(n)=n+23 log(2n) where the base of the log is 2, then which of the following is true: Select one: a. T(n)=θ(n^2) b. T(n)=θ(n) c. T(n)=θ(n^3) d. T(n)=θ(3^n) 3. Let f and g be...
1. (15 pts total) Prove or disprove each of the following claims, where f(n) and g(n)...
1. (15 pts total) Prove or disprove each of the following claims, where f(n) and g(n) are functions on positive values. (a) f(n) = O(g(n)) implies g(n) = Ω(f(n)) (b) f(n) = O(g(n)) implies 2^f(n) = O(2^g(n)) (c) f(n) = O((f(n))^2)
which of the following are true: (1) f(n) = o(g(n)), (2) f(n) = Θ(g(n)), or (3)...
which of the following are true: (1) f(n) = o(g(n)), (2) f(n) = Θ(g(n)), or (3) g(n) = o(f(n)) for each function. Justify briefly your choices. 1. f(n) = 22n, g(n) = 3n + logn. 2. f(n) = √n + log(nn) + 500, g(n) = n.
For each of the following pairs of functions f and g (both of which map the...
For each of the following pairs of functions f and g (both of which map the naturals N to the reals R), state whether f is O(g), Ω(g), Θ(g) or “none of the above.” Prove your answer is correct. 1. f(x) = 2 √ log n and g(x) = √ n. 2. f(x) = cos(x) and g(x) = tan(x), where x is in degrees. 3. f(x) = log(x!) and g(x) = x log x.
Exercise 1. Prove that floor[n/2]ceiling[n/2] = floor[n2/4], for all integers n.
Exercise 1. Prove that floor[n/2]ceiling[n/2] = floor[n2/4], for all integers n.
f:N->N f(1)=3 and f(2)=5 and for each n>2, f(n)=f(n-1)+f(n-2). Please prove that for each n in...
f:N->N f(1)=3 and f(2)=5 and for each n>2, f(n)=f(n-1)+f(n-2). Please prove that for each n in N, f(n)*f(n+2)=(f(n+1))^2+(-1)^(n) using induction.
If n is an odd integer, prove that 12 divides n2+(n+2)2+(n+4)2+1. Please provide full solution!
If n is an odd integer, prove that 12 divides n2+(n+2)2+(n+4)2+1. Please provide full solution!
(a) Show that if f(n) = O(f′(n)) and g(n) = O(g′(n)) then f(n) + g(n) =O(f′(n)...
(a) Show that if f(n) = O(f′(n)) and g(n) = O(g′(n)) then f(n) + g(n) =O(f′(n) + g′(n)).    (b)Solve T (n) = T (n − 1) + n2 using the recurrence tree method. In particular, what is big-O of T(n).