Knowee
Questions
Features
Study Tools

For each of the following statements, mark in the answer sheets whether the statement istrue or false.(a) n2 ∈ O(n)(b) 22 ∈ O(1)(c) n2 − 4n ∈ O(15n)(d) 4 log n + 10 log2 n ∈ O(log2 n)(e) 3n ∈ O(n!)

Question

For each of the following statements, mark in the answer sheets whether the statement istrue or false.(a) n2 ∈ O(n)(b) 22 ∈ O(1)(c) n2 − 4n ∈ O(15n)(d) 4 log n + 10 log2 n ∈ O(log2 n)(e) 3n ∈ O(n!)

🧐 Not the exact question you are looking for?Go ask a question

Solution

(a) Falso. n2O(n) n^2 \notin O(n) . La función n2 n^2 crece más rápido que n n .

(b) Verdadero. 22O(1) 22 \in O(1) . Cualquier constante pertenece a O(1) O(1) .

(c) Verdadero. n24nO(15n) n^2 - 4n \in O(15n) . Aunque n2 n^2 crece más rápido que 15n 15n , la notación O O considera el término dominante, y n24n n^2 - 4n está acotado por una constante multiplicada por 15n 15n para valores grandes de n n .

(d) Verdadero. 4logn+10log2nO(log2n) 4 \log n + 10 \log^2 n \in O(\log^2 n) . El término 10log2n 10 \log^2 n domina, y 4logn 4 \log n es menor que log2n \log^2 n para valores grandes de n n .

(e) Verdadero. 3nO(n!) 3^n \in O(n!) . La función n! n! crece mucho más rápido que 3n 3^n .

This problem has been solved

Similar Questions

For each of the following statements, mark in the answer sheets whether the statement istrue or false.(a) Let f and g be positive functions. Then, f (n) + g(n) ∈ O(n) implies that f ∈ O(n)and g ∈ O(n).(b) There exist functions f, g ∈ Ω(n) such that f − g ∈ Ω(g) and 2g − f ∈ Ω(f ).

6. Give as good a big-O estimate as possible for each of these functions.a) (n2 + 8)(n + 1) b) (n log n + n2)(n3 + 2) c) (n! + 2n)(n3 + log(n2 + 1))

A) Big-O notation and loop invariants1. Let g(n) be a function. For each of the following statements, mark in the answer sheetswhether it is correct (true = correct, false = incorrect).(a) Θ(g) = {f (n) : There exist positive constants c1, c2 and n0 such that0 ≤ c1 · g(n) ≤ f (n) ≤ c2 · g(n), for all n ≥ n0}(b) Θ(g) = {f (n) : There exist positive constants c1, c2 and n0 such that0 ≤ c1 · f (n) ≤ g(n) ≤ c2 · f (n), for all n ≥ n0}(c) Θ(g) = O(g) ∩ Ω(g)

2. Determine whether each of these functions is O(x2).a) f (x) = 17x + 11 b) f (x) = x2 + 1000 c) f (x) = x log xd) 42xf x  e) 2xf x  f) ) f (x) = (x3 + 2x)/(2x + 1)

(15 points) Prove that the following assertion is true for all values of n ≥ n0. Identify both n0 and c.2n + 5∈ O(n2)

1/3

Upgrade your grade with Knowee

Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.