Which of the following could be false? A. n2/(log(n)) = O(n2). B. (log n)1000 = O(n1//1000)....

Question

Question

Which of the following could be false? A. n2/(log(n)) = O(n2). B. (log n)1000 = O(n1//1000)....

Which of the following could be false?

A. n²/(log(n)) = O(n²).
B. (log n)¹⁰⁰⁰ = O(n^1//1000).
C. 1/n = O(1/(log(n))).

D. 2^{(log(n))^2} = O(n²).
E. None of the above.

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

Sol Given first option D is Reog(n)) ? eogn) dotted & n? n² aogn) <=22. n m² Aogos) = O(n) So Cue can say 2) Given sc Second $1 logn n 256 Let substitute 256 log 256 s 8 256 thee ² (Tove higher the demorate 256 valoc Lower the Whor fraction value) d)$

Add a comment

Answer 2

Similar Homework Help Questions

1) True or false? a. n2 = O(n3) b. 2n2 + 1 = O(n2)...

1) True or false? a. n2 = O(n3) b. 2n2 + 1 = O(n2) c. n1/2 = O(log n) d. log n = O(n1/2 ) e. log n + n1/2 = O(n2) f. log n = O( n-1/2) g. log n = O( 1/n ) h. log (n + 3) = q(n1/2) i. n + n1/2= W( n2 - n )
O(log(log(N))) < O(log(N)) a. True b. False O(N ) < O(log(N)) a. True b. False O(...

O(log(log(N))) < O(log(N)) a. True b. False O(N ) < O(log(N)) a. True b. False O( N5) < O(N2 - 3N + 2) a. True b. False O(2N) < O(N2) a. True b. False
For the repeated-measures t statistic, df = ________. a. n1 + n2 – 2 b. (n1...

For the repeated-measures t statistic, df = ________. a. n1 + n2 – 2 b. (n1 – 1) + (n2 – 1) c. n + 1 d. n1 + n2 – 1 e. n – 1

n1 n2 6. Light rays cross interfaces from medium 1 into medium 2 and then into...

n1 n2 6. Light rays cross interfaces from medium 1 into medium 2 and then into medium 3. Which of the following is true? n3 A) n1 > n2 and n2 > n3 B) n3 > n2 and n2 > n1 C) n2 > n1 and n2 > n3 D) None of the above
Assume that a problem A cannot be solved in O(n2) time. However, we can transform A into a problem B in O(n2 log n) time...

Assume that a problem A cannot be solved in O(n2) time. However, we can transform A into a problem B in O(n2 log n) time, and then solve B, and finally transform the solution of B in O(n) time into a solution for A. Prove or Disprove: The above approach shows that B cannot be solved asymptotically less than O(n2) time.
What s the mahermatiab n t Choose the correct answer below. n1 n2 O B. n-1...

What s the mahermatiab n t Choose the correct answer below. n1 n2 O B. n-1 OD, x1-x2

Which of the following series diverges? n +2 2n -1 n1 n+3 O A. 2 B. O C. 1,3 O D. 1, 2 OE. 2, 3 F. None O G. O H. 1,2,3 Find the sum of the series A. B. OC. 1/10 D. 1/2 3/2 3/4 OE. 1 F. 5/12...

Which of the following series diverges? n +2 2n -1 n1 n+3 O A. 2 B. O C. 1,3 O D. 1, 2 OE. 2, 3 F. None O G. O H. 1,2,3 Find the sum of the series A. B. OC. 1/10 D. 1/2 3/2 3/4 OE. 1 F. 5/12 OG. 1/4 H. Divergent Which of the following series converges? oo 2n 1.Σ n 1 23n nE1 (n+ 1)3 n+ 1 3. O A. None O B. 2 O...
Q5 Match the following operations to their corresponding worst case time complexities Operations Finding the nert larger item in a Hash Table Time Complexities од) O (log n) O(n) O(n log n) O(n2) o(n...

Q5 Match the following operations to their corresponding worst case time complexities Operations Finding the nert larger item in a Hash Table Time Complexities од) O (log n) O(n) O(n log n) O(n2) o(n3) O(n + m) O(m logn) O((n +m) log n) O(n2+nm) Trying to remove a non-eristing item from a Hash Table 2 3Finding the previous smaller item in a possibly unbalanced BST Updating a previous value into a new value in an AVL Tree Sorting m edges...
QUESTION 4 Tell whether the following function is O(NZ): f(N) = N * log(N) O True...

QUESTION 4 Tell whether the following function is O(NZ): f(N) = N * log(N) O True O False QUESTION 5 Tell whether the following function is O(N2): f(N) = 0.5n4 O True O False

True or false for each, and explain why (4 pts) The height of a binary tree is bounded by O(n2), where n is the size...

True or false for each, and explain why (4 pts) The height of a binary tree is bounded by O(n2), where n is the size of the C. tree. d. (4 pts) dynamic array and O(1) time if L is a linked list. Given a list L of n > 2 elements, the following code takes O(n) time if L is a iterator i = L. iterator () i.next); i.next); i.remove ); binary tree T that has size n and...

Which of the following could be false? A. n2/(log(n)) = O(n2). B. (log n)1000 = O(n1//1000)....

Homework Answers

Add Answer to:
Which of the following could be false? A. n2/(log(n)) = O(n2). B. (log n)1000 = O(n1//1000)....

Post as a guest

Earn Coins

1) True or false? a. n2 = O(n3) b. 2n2 + 1 = O(n2)...

O(log(log(N))) < O(log(N)) a. True b. False O(N ) < O(log(N)) a. True b. False O(...

For the repeated-measures t statistic, df = ________. a. n1 + n2 – 2 b. (n1...

n1 n2 6. Light rays cross interfaces from medium 1 into medium 2 and then into...

Assume that a problem A cannot be solved in O(n2) time. However, we can transform A into a problem B in O(n2 log n) time...

What s the mahermatiab n t Choose the correct answer below. n1 n2 O B. n-1...

Which of the following series diverges? n +2 2n -1 n1 n+3 O A. 2 B. O C. 1,3 O D. 1, 2 OE. 2, 3 F. None O G. O H. 1,2,3 Find the sum of the series A. B. OC. 1/10 D. 1/2 3/2 3/4 OE. 1 F. 5/12...

Q5 Match the following operations to their corresponding worst case time complexities Operations Finding the nert larger item in a Hash Table Time Complexities од) O (log n) O(n) O(n log n) O(n2) o(n...

QUESTION 4 Tell whether the following function is O(NZ): f(N) = N * log(N) O True...

True or false for each, and explain why (4 pts) The height of a binary tree is bounded by O(n2), where n is the size...

Which of the following could be false? A. n2/(log(n)) = O(n2). B. (log n)1000 = O(n1//1000)....

Homework Answers

Add Answer to: Which of the following could be false? A. n2/(log(n)) = O(n2). B. (log n)1000 = O(n1//1000)....

Post as a guest

Earn Coins

Add Answer to:
Which of the following could be false? A. n2/(log(n)) = O(n2). B. (log n)1000 = O(n1//1000)....