Question

(10) Using limits and L’Hospital’s Rule find the complexity class of f(n) with regard to g(n)...

(10) Using limits and L’Hospital’s Rule find the complexity class of f(n) with regard to g(n) when f(n)=5n3+2n and g(n)=2n4 -1

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

The complexity of is to be compared with . To do this, calculate
. As both the numerator and the denomitor go to infinity, this in indeterminate form. Hence use L'Hospital's rule and differentiate both numerator and denominator to get
. Again it is indetermintate, hence use the rule again to get
as the numerator is finite and the denominator goes to infinity.

Therefore , which impiles .

Hence the answer is . Comment in case of any doubts.

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Understand the complexity of algorithms. Find the c and N for the function g so that...
Understand the complexity of algorithms. Find the c and N for the function g so that f(n) = O(g(n)). 1) f(n) = 4n2 + 3n + 6, g(n) = n2 2) f(n) = 3n2 + 2n + 8, g(n) = n3 3) f(n) = n2 + 4n, g(n) = n2 4) f(n) = 1000 n + 2000, g(n) = n 5) f(n) = 1000 n + 2000, g(n) = n2 6) f(n) = 1000 n + 2000, g(n) = n​​​​​​​3...
f(x)=x^3+1 and g(x) =x^-2 find rule for function f-g
f(x)=x^3+1 and g(x) =x^-2 find rule for function f-g
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. Find f''(x) F(x)= (x^2+2)^9 F''(x)= 2. Find t^(4)(n) for the function t(n)= 2n^-1/2+7n^3/2 t^(4)(n) =...
1. Find f''(x) F(x)= (x^2+2)^9 F''(x)= 2. Find t^(4)(n) for the function t(n)= 2n^-1/2+7n^3/2 t^(4)(n) = (Type an expression using n as the variable. Simplify your answer)
1. A function f : Z → Z is defined by f(n) = 3n − 9....
1. A function f : Z → Z is defined by f(n) = 3n − 9. (a) Determine f(C), where C is the set of odd integers. (b) Determine f^−1 (D), where D = {6k : k ∈ Z}. 2. Two functions f : Z → Z and g : Z → Z are defined by f(n) = 2n^ 2+1 and g(n) = 1 − 2n. Find a formula for the function f ◦ g. 3. A function f :...
1) Derive the quotient rule ( f g ) ′ = (f ′ ⋅ g −...
1) Derive the quotient rule ( f g ) ′ = (f ′ ⋅ g − f ⋅ g ′ )/g 2 using the product rule and the chain rule. I was able to get this with product rule(i think) but unsure how to use chain rule 2) Identify a rate of accumulation (or decay) in your life that changes over time. Be creative. a) Describe it in a sentence or two: the rate of accumulation of pages read this...
f(x)=2pix(1-x/g)^(1/7) g=0.75 n=7 solve with trapezoidal rule and two point guess quadrant and also Analytically
f(x)=2pix(1-x/g)^(1/7) g=0.75 n=7 solve with trapezoidal rule and two point guess quadrant and also Analytically
Consider the following function : F 1 = 2, F n = (F n-1 ) 2...
Consider the following function : F 1 = 2, F n = (F n-1 ) 2 , n ≥ 2 i. What is the complexity of the algorithm that computes F n using the recursive definition given above. ii. Describe a more efficient algorithm to calculate F n and give its running time.
True or False...Provide your reasons If f(n) =o(g(n)), then f(n)=O(g(n)) If f(n) =O(g(n)), then f(n) ≤...
True or False...Provide your reasons If f(n) =o(g(n)), then f(n)=O(g(n)) If f(n) =O(g(n)), then f(n) ≤ g(n) 3.  If 1<a=O(na), then f(n)=O(nb) 4. A and B are two sorting algorithms. If A is O(n2) and B is O(n), then for an input of X integers, B can sort it faster than A.
Using the definition of the DTFT, find the DTFT of f(n) = anu[n + 1] where...
Using the definition of the DTFT, find the DTFT of f(n) = anu[n + 1] where |a| < 1
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT