Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

2. Asymptotic Notation Exercises. (20 points) Indicate whether each of the following statements is True or False then justify your answers; if true, show the

image text in transcribed
2. Asymptotic Notation Exercises. (20 points) Indicate whether each of the following statements is True or False then justify your answers; if true, show the necessary constants (e.g., c,n0, etc.) that satisfy the notation, and if false, argue that no such constants exist. (a) 3n2+n+10=(n2) (b) n=(n2) (c) 10lgn=(1) (d) lgn8=O(lgn) (e) 3n=O(2n) (f) 100n3=o(n3lgn) (g) 5n10=(n10) (h) 3log7n=(log2n) (i) log2(n)=O(log(n2)) (Note: log2(n)=log(n)log(n)) (j) n21=O(1) 3. Asymptotic Notation Properties. (20 points) Let f(n) and g(n) be asymptotically non-negative functions. Using the definitions of asymptotic notation: (a) (5 points) Prove that if f(n)=o(g(n)) and g(n)=o(h(n)) then f(n)=o(h(n)). (b) (5 points) Prove that if f1(n)=O(g1(n)) and f2(n)=O(g2(n)) then f1(n)+f2(n)= O(g1(n)+g2(n)) (c) (5 points) Prove that if f(n)=O(n)+O(n2)+O(n3) then f(n)=O(n3). (d) (5 points) Disprove that if f(n)=O(g(n) ) and g(n)=(h(n)) then f(n)=(h(n)). To do this, you need to provide a counterexample by showing a specific f(n),g(n),h(n) that do not satisfy the above statement

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Structured Search For Big Data From Keywords To Key-objects

Authors: Mikhail Gilula

1st Edition

012804652X, 9780128046524

More Books

Students also viewed these Databases questions

Question

Explain the function and purpose of the Job Level Table.

Answered: 1 week ago