[SOLVED] CECS328-Homework 2

20.99 $

Programming resource
Digital learning resource
Category:
✓ Practical programming resource
✓ Suitable for guided study and reference
✓ Tutor guidance available when needed

Description

Rate this product
  1. Prove that f (n) =10n4 +2n2 +3is O(n4), provide the appropriate C and k constants.
  2. Prove that f (n) = 2n2 −n logn+3lognis O(n2), provide the appropriate C and k constants.
  3. Prove that f (n) = 2n4 logn4 −n2 +3logn is O(n4 log n), provide the appropriate C and k constants.
  4. Prove or disprove
    • (n)=5n3 −n+3

:

  1. f(n) = O(n2)
  2. f(n) = Ω(n)
  3. f(n) = ϴ(n3)
  4. f(n) = ω(n)
  5. f(n) = o(n2)

Provide the appropriate C and k constants if possible (for parts a,b,c).

  1. Prove that (𝑛 + 5)100 = Ѳ(𝑛100).
  2. Prove transitivity of big-O: if f(n) = O(g(n)), and g(n) = O(h(n)), then f(n) = O(h(n)).
  3. Prove that f(n)=O(g(n)) iff g(n)= Ω(f(n)).
  4. Compare the growth of:
    1. f (n) = n and g(n) = n1+sin n .
    2. 𝑓 and 𝑔(𝑛) = n + sin(n)
    3. 𝑓(𝑛) = 𝑛 and 𝑔(𝑛) = n ∗ |sin(n)|
  5. Prove or disprove: 2n+1=O(2n).
  6. Prove or disprove: 22n=o(2n).

f (n)

  1. Prove that if lim ⎯⎯→ = C , for some constant C>0, then f(n)= ϴ(g(n)). g(n)

f (n)

Hint:  lim ⎯⎯→    = C means that for every ϵ>0, there exists k>=0 such that, for all n>=k,  g(n)

  • (n)

|  −C | g(n)

Resource details

Understand the Task Before You Use the Resource

Review the requirements, identify the programming concepts involved, study the implementation and test your understanding with your own examples and modifications.