3. 4. s := 0; i := n; while i ≥ 1 do i := i div 2; for j = 1 to i do | s:=s+1 end end for i:=1 to n do j:=i²; while j≤n do | j:=j+1 end end

Q: Give a discussion of an asymptotic formula predicting the number of computer operations needed to…

A: Asymptotic Expansions.  We prefer the equation f(N)=c0g0(N)+O(g1(N))f(N)=c0g0(N)+O(g1(N)) with…

Q: 5. Consider the trisection method, which is analogous to bisection except that at each iteration, it…

A: The bisection method will converge on a root, one may naturally ask if sectioning an interval in…

Q: 3. Use a fixed-point iteration to find a solution to within 10-2 for 2-1-1= 0 on [1,2]. Use po = 1.…

A: Answer: Python Source Code: import math def f(x):    return x*x*x-x-1 def g(x):    return x def…

Q: Please help me solve this with Matlab  Heron’s Method for Finding Square Roots  During this lab…

A: Here's an outline of the steps you can follow to complete the requirements for the Heron's Method…

Q: Briefly describe a method to calculate logarithms in base 2 and 10 using that calculator

A: Most  of the calculators only have a logarithms with base 10 or base e on them. Hence  in order to…

Q: Analysis of Algorithms Compute given sum by driving some formulae : 4+8+12+16+….+200

A: Definition: Algorithm:       It is defined as the set of finite set of the well defined instructions…

Q: Overflows You have learned the concept of overflow (with say n! that overflows at 13! for integer)…

A: In fibonacci series next number is the sum of previous two numbers.

Q: Analyze the Time Complexity. Show your solution and the corresponding Big-O notation.

A: Determine the basic operation, that is, the operation that contributes the most to the total…

Q: a. T(n) = k+T(n/4k)+n² b. T(n) = k*T(n/k)+n³

A: The general form of divide and conquer problem is given by the following equation:…

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: For each function given below, find the greatest positive integer n such that an is O(g(x)). (a)…

A: Answer: a. To determine the greatest positive integer n such that x^n is O(g(x)), we need to find a…

Q: Cake the list of common names for growth-rate function Iphabetic order; give the big-O notation…

A: Big-O fastest means the algorithm with time complexity as less a possible. here constant time…

Q: The search algorithm developed will be used for users to search the catalog for all items matching…

A: Let us first see what exactly is happening here. Assume that you are searching for something on a…

Q: The first time you run alg second time you run algor

A: The first time you run algorithm A on a dataset of n elements; it is faster than algorithm B. The…

Q: Consider the following matrix of values:  x = [45, 23, 17, 34, 85, 33] Use a for loop to find how…

A: For this MatLab program, we will be using a for loop to go through each element of the vector and…

Q: 1. Using the steps in analyzing a problem, show how to solve a problem that obtains two integer…

A: A regular octagon is a closed figure with sides of the same length and internal angles of the same…

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 importance of finding the best alpha if we are gonna use the Tikhonov regularization…

A: INTRODUCTION: Here we need to tell the importance of finding the best alpha if we are gonna use the…

Q: Func3(n) 1 2 3 4 5 6 7 s ← 0; for i 1 to 2n² do for j1 to 1³ do end s+s+i- j; end return (s);

A: 1. Initializing variables: s &lt;- 0 takes constant time, O(1). 2. Outer loop: The outer loop…

Q: How much time is required to compute f(x) = Eo a;x: a. Using a simple routine to perform…

A: Actually, given information  f(x) = sigma_i = 0^N a_i x^I.

Q: The performance of a binary searching method is logarithmic. O(logn)finding a particular item from a…

A: Here is the complete calculation of the above problem. We need to use that  formula.

Q: 3. Give an analysis of the running time (Big-Oh will do).   sum = 0;   for( i = 0; i < n; ++i )…

A: sum = 0;   for( i = 0; i &lt; n; ++i )   for( j = 0; j &lt; n; ++j )   ++sum;

Q: 2. For each statement below regarding the running time of ALGO, insert a T or F in the box depending…

A: Algorithms which refers to a finite sequence of rigorous instructions, which are typically used to…

Q: a. Prove that count[j] equals the number of times j appears in data[1::i], for every j from 1 up to…

A: In this question we have to

Q: Use the Booth Algorithm (as covered in class) to compute 15 x (-5) (M = 15; Q = -5; do not change…

A:

Q: Write the body of an iterative function to compute n! for n 2 1.

A: Please refer below for code and output: According to company guidelines I am able to anser first…

Q: 7. T(n) = 3T (4) +n³ base case: n = 1

A: The above question is solved in step 2 :-

Q: 3. Determine the running time of the following algorithms. Write summations to represent loops and…

A: Order of growth defines efficiency of an algorithm. The order of growth of an algorithm is an…

Q: Write down the summation version of the run-time of the following algorithm. Do no simplification,…

A: According to the information given:- We have to summarize approximate run-time of the following…

Q: Write a program in MATLAB that receives an n * (n + 1) matrix and calculates and prints the output…

A: function[L,U,X]=LU_Parker(A,B)[m n]=size(A);if (m ~= n )disp ( 'LR2 error: Matrix must be square'…

Q: 10. Give a big-O estimate for the number of operations, where an operation is a comparison or a…

A: Give a large estimate of the number of operations, where the operation is a comparison or a…

Q: et us assume that we only have a calculator that can calculates natural logarithm (i.e., Ln or…

A: The solution is given in the below step

Q: Continue your investigation. The following are all suggestions, not requirements, and you certainly…

A: Algorithm: Gauss-Legendre Method for Approximating πInputs:- Number of iterations (n)1. Initialize…

Q: To estimate the amount of water that flows in a river during a year, a section of the river is made…

A: Matlab:- 1. Compiled programs can be executed by any number of users on their own computers without…

Q: The diagram below shows roads connecting towns near to Rochdale. The numbers on each arc represent…

A: Answer: We need to write the find the minimum path from source to destination using the Dijkstra's…

Q: Given two sequences, print all the possible longest common subsequences present in them. For…

A: Let X be XMJYAUZ and Y be MZJAWXU. The longest common subsequence between X and Y is MJAU.  The…

Q: 5. What is the time co е со for(i=0; i<n; i+) k = k+%;

A: INTRODUCTION: Here we need to tell the time complexity of the following code.

Topological Sort

Topological sort is a sorting technique that sets up a hierarchy in a process. In this technique, when a directed network has nodes connected by arrows, the root node is placed before the successor node.