Big O notation true or false questions? Are these true or false? Using true (not abused)...

Question

Question

Big O notation true or false questions?

Are these true or false? Using true (not abused) meaning of Big-O (and Big-Omega), not just the tightest bound

Big O notation true or false questions? Are these

engineering Computer-Science

Answer 1

Answer #1

Answer:

6. n^2 + logn^2 = omega (n)

It is true , check f(n) > = c1*g(n)

here f(n) = n^2 + logn^2 = n^2 + nlong , g(n) = n

now omega definition : f(n) > = c1*g(n)

= n^2 + nlogn > = n * c1

It satisfies the definition by c = 1 and n = 2

thus it is true

7. True , as n^n is always greater than n!

8. It is true as in the given equation logn is the highest term.

9. It is false as it is dependent on n so cannot take constant time.

10. It is true as the highest term in the equation is n^6.

Answer 2

Similar Homework Help Questions

PYTHON: Im stuck here, big O notation and runtime. What is it and Why are they...

PYTHON: Im stuck here, big O notation and runtime. What is it and Why are they those? Please look at the pic, need help as Im confused. Thank You! def method3(n): for i in range(n): for j in range(100): for k in range(n): print(i+j+k) What is the runtime (tightest/closest bound in terms of O) for the above python function (method 3)? Please briefly explain. Enter your answer here def method4(n): for i in range(n): for j in range(n, o, -2):...
Choose the equivalent Big Oh notation for the functions given below. If there is more than...

Choose the equivalent Big Oh notation for the functions given below. If there is more than one option, circle the tightest asymptotic bound. function f(n) = 5n - 10 belongs to a) O(1) b) O(n) c) O(n2) d) O(log n) function f(n) = 4n2 + 4n + 1 belongs to a) O(1) b) O(n) c) O(n2) d) O(log n) function f(n) = n2 + 100 log n belongs to a) O(1) b) O(n) c) O(n2) d) O(log n)
Describe the order of magnitude of the following code section using Big(O) notation. k=0; for (i=...

Describe the order of magnitude of the following code section using Big(O) notation. k=0; for (i= 0; i<N; i++)

The more rapidly a drug's effects are experienced, the more likely it will be abused. True or False

The more rapidly a drug's effects are experienced, the more likely it will be abused. True or False
what is the tightest big-o bound on the size of the stack during depth first search...

what is the tightest big-o bound on the size of the stack during depth first search of a tree starting at the root, where n is the number of nodes in the tree? and why?
Give the tightest bound in terms of Big O public type something(n){ result =...

Give the tightest bound in terms of Big O public type something(n){ result = 0; while (n > 1){ n /= 2; result += 1; } return result; }

7. [4] (Big-O-Notation) What is the order of growth of the following functions in Big-o notation?...

7. [4] (Big-O-Notation) What is the order of growth of the following functions in Big-o notation? a. f(N) = (N® + 100M2 + 10N + 50) b. f(N) = (10012 + 10N +50) /N2 c. f(N) = 10N + 50Nlog (N) d. f(N) = 50N2log (n)/N
Give the tightest bound in terms of Big O public type foo(n, a[]){ for (i=0, i<n;...

Give the tightest bound in terms of Big O public type foo(n, a[]){ for (i=0, i<n; i++){ if (a[i] == 0) return 0; } return 1; }
How fast (big O notation is enough) can you check if two lists of n integers...

How fast (big O notation is enough) can you check if two lists of n integers each has at least one integer in common? (hint: sorting a list of n integers – meaning putting them in order, takes time with the best algorithms we have). O(nlog(n)

Describe the order of magnitude of the following code section using Big(O) notation j = 1;...

Describe the order of magnitude of the following code section using Big(O) notation j = 1; While (j < N) { j = j * 2); } Can someone give me a more Clearer answer please.