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
If log(x) = 0.4, log(y) = 0.6 then logy(x) =
nlog(n) = O(nlog(log(n)) True or False and explain why
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
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 )
128289 Computer Science Q1. True or False? O(n) is called linear time 02. True or False? O(n*n) is called quadratic time 03. True or False? An algorithm that has complexity O(log n) is always faster than one that has O(n) complexity. 04. What is the output of the below code: int main() int arrl5] 1,2,34,5) cout< arr[5] Q5. Arrange these time complexities from low to high
Which of the following could be false? A. n2/(log(n)) = O(n2). B. (log n)1000 = O(n1//1000). C. 1/n = O(1/(log(n))). D. 2(log(n))^2 = O(n2). E. None of the above.
QUESTION 1 (x + x2)log x + x2.5 is ou O x2 log x O X3 O x2 O x log x QUESTION 2 If f(x) is O(g(x)) and g(x) is O(h(x)) then f(x) is O(h(x)). True False
Determine whether the statement below is true or false. If y= log ,x, then y=a*. Choose the correct answer below. True False
Question 7 Log files are a static snapshot of the performance of a system. True False