Q1. a) Find & prove whether f(n) is O g(n) , 9 g(n) or N g(n) i. f(n) = n°6 •log(n) and g(n) = 4" f(n) = n°3 and g(n) = n°6 *log(n) b) Write the following functions in increasing order of Asymptotic Growth. faln) = 26 f2(n) =n°,2 f3(n) = S6 + n log, n fa(n) = S6•n loe, " c) Correct or Not? 2" = 0( S, n*1) (n+3)(n+S4) = 0 (n logn) n°s / log(3n) = 0 (n ( log, n)°3 ) S6" =0(n°)

Q: 6- Compute the convolution x[n]*h[n] for all n 2 0, MATLAB x[0] = 4, x[1] = 1, x[2] = -1, x[n] = 0…

A:

Q: 6. Suppose functions f(n) > 0 and g(n) > 0 satisfy f(n) = 0(9(n)). Prove or give a counterexample to…

A: Given that, f(n)>0, g(n)>0 and f(n)= O(g(n)) f(n)=n3, g(n)=n3+n, then f(n)= O(g(n)) is true.…

Q: n-17 .. n. For example, if n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,3],…

A: Machine independent language :- > the language which does not depend on the computer or its parts…

Q: Find y[n]=x[n]*h[n] x[0] = 2, x[1] = 3, x[2] = 5, x[n] = 0 for all other integers (n). h[0] = 2 ,…

A: Introduction Given x is an array of values and x[0]=2, x[1]=3, x[2]=5, x[n]=0 , for all other…

Q: Find y[n]=x[n]*h[n] x[0] = 2, x[1] = 3, x[2] = 5, x[n] = 0 for all other integers (n). h[0] = 2 ,…

A: Introduction Given x is an array of values and x[0]=2, x[1]=3, x[2]=5, x[n]=0 , for all other…

Q: Solve the following recursive function and describe it in terms of Big-O using expansion. T(n) =…

A:

Q: 5. Order Notation. Consider each pair of functions below. Give a formal using a direct proof…

A: Here in this multi parts question we have have two function f(n) and g(n).so using some formal proof…

Q: 2 Find the order of growth of the following sums. Use the e(g(n)) notation with the simplest…

A: As per your requirement only 2(D) part solve:

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: Consider the function f : N → N given recursively by f(0) = 1 and f (n + 1) = 2· f(n). Find f(10).…

A: Here in this question we have given a function F(n+1)= 2*F(n) and f(0)=1 And we have asked to find…

Q: 2. Let C be an (n, k, d)x code. Then it can be converted into an (n– 1, k, d – 1)x code.

A: #include <stdio.h>#include <math.h>void findNumberOfDigits(long n, int base){  int dig =…

Q: 1 % Define variable(s) here. 2 k=0.24 3 m=b5 4 g=9.81 5 t=8 7 v=(sqrt((m*g)/k)…

A: Correct formula for m and d is  v=((sqrt((m*g)/k))*tanh)*((sqrt((k*g)/m))*t)…

Q: 3. Let f(x, y) = (2x – y,x – 2y); (x, y) E R × R, (R is set of real numbers.) a) Show that f is one…

A: Answer : 3. a) Given f(x,y) = (2x-y, x-2y) = z (say) Let us choose any 2 (x,y) variable pair as (x1,…

Q: Problem 5. Prove that n³ e O(1.2"), but n³ ¢ O(1.2"). You may use the facts that log(n) E O(n) but n…

A: Proved the given asymptotic function

Q: procedure Horner(c, a_(0), a_(1), a_(2),… , a_(n): real numbers) y := a_(n) for i := 1 to n y := y ∗…

A: Given: Procedure Horner (c, a0, a1, a2,.....,an : real numbers y : an for i = 1 to n y = y * c+an-i…

Q: 1. a) Suppose that f is defined recursively by: f(0) = 5 and f(n + 1) = 2fn + 5. Find f(1), f(2),…

A: 1. a) Suppose that f is defined recursively by: f(0) = 5 and f(n + 1) = 2fn + 5. Find f(1), f(2),…

Q: Find y[n]=x[n]*h[n] x[0] = 2, x[1] = 3, x[2] = 5, x[n] = 0 for all other integers (n). h[0] = 2 ,…

A: Given x is an array of values and x[0]=2, x[1]=3, x[2]=5, x[n]=0 , for all other values of n   Given…

Q: 3. Write a pseudo code function m(i) to compute the following series using a recursive method m(i) =…

A: The base case is when i=1 we exit from recursive function with 1 otherwise we will add the…

Q: The Modular Operation z mod m =r denotes that r is the remainder of the division of r by m. For…

A: The answer is as follows:

Q: Write a nToArray function which does the following: 1. Accepts an empty partially filled array, the…

A: Programs: The programs are mainly used for problem-solving. It contains the instructions to solve…

Q: Express following function a) F = x + y'z b) F = AB + A'C as sum of minterms as product of maxterms

A: In given question, we have to find out the sum of minterms in part a) and product of maxterms in…

Q: Let A = {m ∈ Z | m ≡ 9 (mod 12)}. Let B = {n ∈ Z | n ≡ 1 (mod 4)}.

A: We are going to prove that set B is not a subset or equal to set A. First find out what is set A and…

Q: Generate random matrices of size n × n where n = 100, 200, . . . , 1000. Also generate a random b ∈…

A: Summary: -    At the end we will get the output.

Q: 3. Write a pseudo code function m(i) to compute the following series using a recursive method =…

A: Recursion method means calling method itself.

Q: cci series begins with the terms 0 and 1 and has the property that each succeeding term is the sum…

A: Start Now declare variables i, b, c, fib we will initialize the variables b=0, c=1 and fib=0 Enter…

Q: 3. Write a pseudo code function m(i) to compute the following series using a recursive method m() =…

A: Pseudocode: float sumOfSeries(int i, int n, float s){        if (i > n )             return s;…

Q: (b) Prove that if m, d, and k are integers and d > 0, then (m + d*k) mod d = m mod d. Use the…

A: b)  The objective is to prove , where  are integers and  ,

Q: {a^n b^m n 2 m}. Let R1 = {(a U b)* : odd a's and epts L1 n R1.

A: CFG is known as context free grammar. It's used to make all possible patterns of string from the…

Q: Exercise III: Catalan numbers For n e N, denote by c, to be the number of ways to form a "mountain…

A: Answer: Our guidelines is answer the first three question from the first question. I have given…

Q: # we want the square root of 17 for example g = 4                 # our guess is 4 initially error =…

A: Code: def newton_method (number, number_iters = 100) : a = float (number) for i in range…

Q: Problem Statement: Show that the following statements are equivalent, where n is an integer greater…

A: From the given problem statement, n is an integer greater than or equal to 2.   1. “n is even” and…

Q: ..,A+(N-1) K) and compute the product of all elements of this sequence; let's For example, if N=3…

A: Given:

Q: The Modular Operation r mod m = r denotes that r is the remainder of the division of x by m. For…

A: Solution of the given question is-

Q: ction that given integers j and k where j ≥ 2 that then j is not divisible by k or(∨) j is n

A: Proof by contradiction is a type of verification that builds up reality or the legitimacy of a…

Q: n = 3 for x in n = print(n)

A: n = 3for x in [2, 6, 5]:  n =n+xprint(n)

Q: The order of growth of the function f(n)=2n×n is lower than the function g(n)= 2n×n2. Hence,…

A: Option A is correct answer explanation is as follows

Q: ,A+(N-1)·K) and compute the product of all elements For example, if N=3 and K=2, then Walter can…

A: Given:

Q: ++ Given an integer matrix of size M × N. Find the number of the first of its columns containing an…

A: #inсlude  <bits/stdс++.h>using  nаmesрасe  std;int  соuntNegаtive(int  M[][4],  int  n,  int…

Q: Problem 3 Use the definition of Big-Oh to prove the following statements (find c and ng for each…

A: Given Big-Oh function with c and n0 value

Q: 3. Given function F(a, b, c) is equal to product of maxterms in last four digits of your assigned…

A: Assigned number is 34257

Q: for i=1 to n/2: for j=i to n- : for k=1 to j do print("hello") Let T(n) denote the number of times…

A: Let's solve the question step by step: Answer (1) Understanding the loops First loop: It is running…

Q: Show that the following statements are equivalent, where n is an integer greater than or equal to 2.…

A: statement1. “n is even” and “n – 1 is odd”statement2. “n is even” and “n(square2) is…

Q: 23 Consider  f(n) =  5 n log n ,   and g(n)=  (n+5)    which of the following is true  الاجابات…

A: The computational complexity of time complexity refers to the quantity of computer time required to…

Q: 2. ( Bisec tion Me thod). (i) Show that the polynomial f(x) = 1 + 2x² – 43r – 130 has a unique root…

A: 2 (i)Bisection Method: To find the roots of a polynomial equation, use the bisection process. It…

Q: 1. Find the complexity of the given loop by counting the number of iterations for n = 100 and n =…

A: Find the complexity of the given loop by counting the number of iterations for n = 100 and n = 1000.…

Q: Write a program to read the twenty-element unary matrix X and calculate the sum of its squares 20…

A: Input : Array values of X Output : Sum of the square of values of X

Q: Show that if f(x) is O(x), then f(x) is O(x2).

A:

Q: 5. Practice with RSA algorithm a. Pick two prime numbers p, q, for example, • const int P=23; •…

A: #include<iostream>#include<math.h>using namespace std;int gcd(int a, int b) {   int t;…

Q: for (m 10; m <= 11; m++) { cout << "Table of" << m << endl; for (n = 1; n <= 10; n++) {

A: GIVEN CODE int m;    int n;    for(m=10;m&lt;=11;m++){        cout&lt;&lt;"Table…

Q: 2. Use Dynamic programming to implement a memoized solution for the classic Fibonacci Sequence using…

A: c++ dynamic code for fibonacci sequence