Consider the following statements, choose all that are incorrect. O 1. 3n +7 is O(n^2) (i.e., n square) 2. 3n +7 is O(1) 3. 3n +7 is O(n) 4. 3n +7 is 0(2^n) (i.e., 2 to the power of n) 5. 3n +7 is O(n * log(n)) 6. 3n +7 is o(log(n))

Q: What is the running time function in terms of n? What is the big-oh of the running time function?

A: Question -1: What is the running time function in terms of n? Answer: 26 (n+1)  where n is the…

Q: Match the following: A) f(n)= 3n+5,g(n)=n² B) f(n) =n,g (n)= 31) C) f(n) = Jn,g(n)=5t% S(n) =…

A: Correct Option is A A-> IV B-> II C->I D-> V E->III

Q: 9. The time complexity of the following code is for (i = = 0; i<n; i=i*2 ) for(j = 0; j<n; j++) k++;…

A: The solution is given below with explanation

Q: 1 g(n) = 4 · g(n/3) + log(n)

A: The solution for the above given question is given below:

Q: Let A be an algorithm which has an execution time O (N5), where N is the size of the entry. Which…

A: This question comes from Data Structure which is a paper of computer science. Let's discuss it in…

Q: Which function best represents the number of operations in the worst-case? start = 0; while (start…

A: the worst-case complexity  (normally signified in asymptotic documentation) gauges the assets (for…

Q: 1. count 2. k n ← - 0 3. while k>1 4. 5. 6. 7. 8. end while for j k to n ← count end for k- k/2 -…

A: Your answer is given below.

Q: f(n) = 0 (g(n)) implies.. O a. f(n) g(n) O c. f(n) = g(n) O d. f(n) > g(n)

A: As per our guidelines we are supposed to answer only one question. Kindly repost the remaining…

Q: What is the Big-O of the following? Read code carefully. Q3.1 1 Point n+ 100log n O 0(1) ● O(log n)…

A: Q1. (c) O(n) Q2. (d) O(n^2)

Q: 18. What is the running time of the following algorithm? Input: The number n is a power of 2. 1: i =…

A: The running time of an algorithm or a data structure method typically grows with the input size,…

Q: Write a piece of code to compute: Z[i] = ( X[i] * Y[i] ) / Z[i] Where: i = 0,1 ,2, . , 1023 ..

A: 1. get the input from the user.2. ask for the values which is to be inserted in array.3.…

Q: f (n) = 5n³ + 10n2 + 15n + 1000. Consider the following statements: %3D i. f(n) = 0(n') ii. f(n) =…

A: To determine which statements are true, we need to compare the function f(n) to the various growth…

Q: *Given the following algorithm, x:=1 for i:=1 to n j:=1 While j<n x:=max (x,i*j) j:=j+1 Return x The…

A: Given Data:-

Q: 17. What is the running time of the following algorithm? Input: The number n is a power of 2. 1: for…

A: The running time of the given algorithm is:

Q: 8. The minterms of F(A,B,C) = (A' + B)(A' + C) are: Oo.1,2.3.7)

A: Given the form is in Product Of Sums form: so first find the max terms by converting the given…

Q: : a. [(a mod n) - (b mod n)] mod n = (a - b) mod n

A:

Q: Solve the following recurrence. a. T(n) = 7T(n/2) + n³ b. T(n) = 3T(n/2) + nº.5 c. T(n) = 9T(n/3) +…

A:

Q: Let f(n) = (0.1)^5 n^2-7n + 2 n^4 + 16 n^(3.5) + 100. Which of the following statements is true?…

A: We are given a function f(n) and we are asked which option is fit for this function.We can check…

Q: Find the smallest value of n such that f(x) is O(x^n) for each of the following. a) 3x^2-4x +12 b)…

A: 3x^2-4x +12 = 3x^2-4x = x^2-x = x^2 O(x^n) = x^2 n = 2 or 2 degree polynomial

Q: with T=4, n=12 and A=(3,5,8,8,9,16,29,41,50,63,64,67). Draw the corresponding walkthrough as shown

A: The solution is given below:

Q: The function f(n)= n4.3+ n° log n + 10 is a. O(log n) O b.O(n5) O. o(n5 log n) O d. 0(n2.5) e. O(n…

A: Here in this question we have given a function and we have asked to find complexity in term of big…

Q: If A and B are square matrices of sizenxn, then which of the following statement is not true? det.…

A: GIVEN:

Q: 3.3 For any n € N, let o(n) be the sum of the divisors of n; for example, o(6)=1+2+3+ 6 = 12 and…

A: Complete answer is provided in next step.

Q: Write a piece of code to compute: Z[i] = ( X[i] * Y[i] ) / [j Where: i = 0,1 ,2 , ... , 1023 X: 8bit…

A: An 8-bit unsigned integer has a range of 0 to 255, while an 8-bit signed integer has a range of -128…

Q: 10 t = 0:.01:40*pi; 11 12 f = [e.^cos (t) - (2*cos (4*t))- ((sin (t/12)).^5)]; 13 Efor s=0.1 14 E 15…

A: The problem is based on plotting of graph in matlab using iterative statements. NOTE: '%' symbol in…

Q: int BinDig (int n) { if (n == 1) return 1; else return (1 + BinDig(n/2)); } Find T(n) = number of…

A: Answer is

Q: If f(n) is the number of times that  y=y+A[i]; is executed in the code segment below, which of the…

A: The outer loop is for loop controlled by value of j The inner loop is while loop controlled by value…

Q: The power function can be defined as follows: What is the worst-case running time complexity of…

A: So Below is the answer to this question. Time complexity is most important for every algorithm,…

Q: (2) Algorithm f(n) if n==1 return 1; return 2*f(n-1)+ n*n*n;

A: The solution to the given problem is below.

Q: Q2/ Find the values X by using Linear Equations: 3x1 + 5x2 + x3 = 5 0.5x115x2 + 2x3 = 13 - 5x1 + 7x2…

A: Solution by Inverse Matrix Method Step1: First we represent system of linear equation in matrix…

Q: Solve the question using only a brute force algorithm. Explain your solution and question write…

A: Check the strings from the right end If the two characters at present to check are the same we…

Q: Can someone explain how the ouput is, 642211431136     def Q3(n):                  if (n <= 0):…

A: I have  fixed to print desired  output--------- After  fixing ,  I have  provided  PYTHON  CODE…

Q: 1. Which one of the following is true? 1. O(n) + 2(n) = 0(n) 2. O(n) + 0(n) = 2(n) 3. O(n) + 2(n) =…

A: True about the given functions

Q: Prove the following statement is true using definition of o: 5n^2/3 + 8 log n ∈ o(n).

A: Solution - In this question we have to prove that the given statement is true using the definition…

Q: er N (4 <= N <= 10) calculates in how many different

A: Q. make a program, which for a number N (4 &lt;= N &lt;= 10) calculates in how many different ways N…

Q: Algorithms in pseudo code **MUST** be placed in de blocks/fences, and use `cpp` as the syntax…

A:

Q: Given the universal set of nonzero INTEGERS, determine the truth value of the following statement.

A: SOLUTION -