The following method of computing a is due to Archimedes: 1. Let A = 1 and N =6 2. Repeat 10 times, say: Replace N by 2N Replace A by [2 – V(4 – A?)]/2 Let L = NA/2 Let U = L/1-A² /2 Let P = (U+ L)/2 (estimate of n) Let E = (U - L)/2 (estimate of error) Print N, P, E 3. Stop. Write a program to implement the algorithm.

Q: The following method of computing a is due to Archimedes: 1. Let A = 1 and N =6 2. Repeat 10 times,…

A: code :    % Draw the unit circle clf; t=linespace90,2*pi,200); plot(cos(t),sin(t),'b--); axis equal…

Q: For the following, decide whether T(n) = 0(f(n)), T(n) = $2(f(n)), T(n) = 0(f(n)), or none of the…

A: - We have to perform analysis of complexities shown.

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: Write an algorithm to find the value of Y * from the following (X!), 2(X!), 3(X!) + 3 2 +... .N…

A: Factorial can be calculated using the following recursive formula. n! = n * (n-1)! n! = 1 if n =…

Q: Put 0, 0, N in the right position, the same as the given example a) n² = ..· (n), solution: n² =…

A: here have to determine about big o, omega, theta of function.

Q: * Write an algorithm to find the value of Y from the following Y = 4), 2(X!) (X!), 2(X!), 3(X!) +- 3…

A: The algorithm to find the value of y is

Q: Put 0, 0, N in the right position, the same as the given example a) n² = .- (n), solution: n2 =…

A: First of all, we need to define the symbols as follows. θ = equal function(average case) O = worst…

Q: 3. Using a simulation of three decimal digit arithmetic on a com- puter, find the sum of the…

A: Note: As per guidelines we are supposed to answer only one question at a time (part d having…

Q: 3. Using a simulation of three decimal digit arithmetic on a com- puter, find the sum of the…

A: Note: Since your question contain multiple sub-parts but e can answer only first 3-sub parts at a…

Q: What is the execution time and time complexity of the algorithm below? void warshall(int A[][], int…

A: in step 1, first we know what is execution time, execution time is that required time to  complete…

Q: 3. Put 0, 0, N in the right position, the same as the given example: a) n2 = .-· (n), solution: n2 =…

A:

Q: * Write an algorithm to find the value of Y from the following (X!) Y= - 2 2(X!) 3(X!) + 4 +. .N…

A: THE ANSWER IS

Q: Write a program that reads N from the user and compute the following series:  (N-1)-((N-2)^2) /8+…

A: using C++ language for  this problem algorithm= styep-1 initialize the variable  step2 generate a…

Q: Match the following: A) f(n)= 3n+5,g(n)=n² B) f(n) =n²"),g(n)=3@-1) C) f(n)= \n,g(n)= 5°e; f(n) =…

A: We are given 5 functions pair of f(n) and g(n)  and we have to find out their asymptotic growth and…

Q: Suppose a genetic algorithm uses chromosomes of the form x = abcdefgh with a fixed length of eight…

A: To calculate the fitness apply the given fitness formulae the ones having higher f(x) values are…

Q: To demonstrate, let's apply the algorithm to n = 100 and see what happens. 1. 100 $ 3 is 1, so our…

A: % operator gives the remainder and / operator gives the quotient.

Q: When multiplying an elliptic curve point P by a positive integer n, it can be done in O(log n) time…

A: Dear Student, Here 6 in binary is 0110 so it's expressed as  ((0*2+P)*2+P)*2, here 0 for each next 0…

Q: Benford’s Law involves looking at the first digit of a series of numbers. For example, suppose that…

A: Actually, given information: Benford’s Law involves looking at the first digit of a series of…

Q: The Fibonacci sequence is defined as follows: ϕ0=0, ϕ1=1, ϕn=ϕn−1+ϕn−2.  ϕ0=0, ϕ1=1, ϕn=ϕn−1+ϕn−2.…

A:

Q: For each of the following expressions, find if they are O(1), O(2"), O(n²), O(log n), O(n2022), O(n…

A: Below are the answers with reason:

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: f(n) = log x + n² + 14n + 15 is f(n) in O(n²), O(n³), 2(n²), Q(n), O(n² ), O(n), Q(n³), O(n), or…

A: Hi there, Please find your solution below, I hope you would find my solution useful and helpful.…

Q: Suppose a genetic algorithm uses chromosomes of the form x = abcdefgh with a fixed length of eight…

A: Answer:

Q: Given a positive integer, N, the '3N+1' sequence starting from N is defined as follows: If N is an…

A: Introduction of the Program: The C++ program takes the number from the user as input and then the…

Q: Consider a series of numbers given below. Identify the suitable Start, End and Interval values for…

A: option B

Q: Give a Θ(lg n) algorithm that computes the remainder when xn is divided by p. For simplicity, you…

A: Give a Θ(lg n) algorithm that computes the remainder when xn is divided byp. For simplicity, you may…

Q: Suppose a = 3 (mod 12) and b = 8 (mod 12) where a and b are integers. Find the integer c with 0 < c…

A: Congruent modulo  For n&gt;=2, if any two integers say 'p' and 'q' are divided by 'n' then they gave…

Q: What is the growth rate of the following algorithm?             y = 1;             for  (i=1;…

A: O(n 2) - Time complexity is considered as O(n2) when there are two loop in which one is nested loop…

Q: The Virtual Weight (vW) of an integer number (which consists of more than 1 digit) is the sum of the…

A: The program prompts the user to enter a number between 5 and 20. The user is prompted to do so until…

Q: The Virtual Weight (VW) of an integer number (which consists of more than 1 digit) is the sum of the…

A: A C++ program is as follows, File name: “main.cpp” #include&lt;iostream&gt; #include &lt;cstdlib&gt;…

Q: Write a program that does the following: f(x) = x² – 3x 1) define and g(x) = cos(2.x) f(x) lim 2)…

A: The problem is based on the basics of matlab.

Q: Write programs using QtSpim to do the following 1) int x=1;     x=x+2; 2) x=5;     if (x>0)…

A: 1) main:         daddiu  $sp,$sp,-32         sd      $fp,24($sp)         move    $fp,$sp         li…

Q: Given a positive integer, N, the '3N+1' sequence starting from N is defined as follows: If N is an…

A: #include &lt;iostream&gt;using namespace std;int sequence(int N){    int x,count = 1;…

Q: Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an…

A: The main objective of the C++ program, main. cpp is to prompt the user to enter a value and read a…

Q: Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an…

A: I have coded in Javascript because programing language was not mentioned. You can use the concept…

Q: non that given an integer n, it finds all binary sequences of length 2n such that the sum of the…

A: In this program the if n=3 then the binary sequence first 3 bits and last bit sum should be same.…

Q: What is the execution time and time complexity of the algorithm below? void warshall(int A[][], int…

A: To Do: To write the execution time and time complexity of the algorithm below.

Q: Consider the following uniformly distributed random numbers. Generate an exponentially distributed…

A: Lets see the solution.

Q: Determine the asymptotic running time of f(n). int f(int n) { int x; if (n == 0) x = 1; %3D%3D else…

A: Answer is given in step 2

Q: Determine the asymptotic running time of f(n). int f(int n) { int x; if (n == 0) x = 1; %3D%3D else…

A: The restricting performance of the running time of an algorithm when the number of execution lines…

Q: If we solve T(n) = T(n/2) + 0(n), we obtain T(n) = 0(n log n). "True False (Randomized) Quicksort…

A: answer :-   FALSE  T(n)=T(n/2)+Thetha (n)                                       , thetha(n) can…

Q: Write the python program to find solve the following series: Write two programs one by using while…

A: For for loop ans_for=0for j in range(1,n+1):    ans_for +=(n*n)/((n+1)(n+2))**(n+3) For while…

Q: The square root of any number N>0 can be opproximated by repeated calculation using the formula N -…

A: Below is the code for calculation square root using the formula, N = squared_root; NG = 0.5(FG + (N…

Q: For each of the following code snippets, give an analysis of the running time (Big-Oh will do). (1)…

A: Big  О  оr  Big  Оh  is  асtuаlly  shоrt  fоr  Big  Оmiсrоn.  It  reрresents  the  uррer  bоund  оf…

Q: The conventional algorithm for evaluating a polynomial anx" + an-1x"-1 + .…. + a¡x+ ao at x = c can…

A: Note: As per the guidelines, we are supposed to answer one full question, please repost other…

Q: 2. Find the sum of the following series 1/2 - 2/3 + 3/4 - 4/5 + 5/6 - ...... n (n is the number of…

A: Since the coding language is not mentioned, I have done the code in C++. Algorithm :  Step 1 :…

Q: Let's consider a variable NU has value 12, what are the different methods to reduce the value by 1…

A: Let's consider a variable NU has a value 12, what are the different methods to reduce the value by 1…

Q: Write the python program to find solve the following series: Write two programs one by using while…

A: Required:

Q: There are two algorithms called Alg1 and Alg2 for a problem of size n. Alg1 runs in n^2 microseconds…

A: Given: There are two algorithms called Alg1 and Alg2 for a problem of size n. Alg1 runs in n^2…