solve in assembley language, MIPS Square Root Calculation: Newton’s iterative method can be used to approximate the square root of a number x. Let the initial guess be 1. Then each new guess can be computed as follows: guess = ((x/guess) + guess) / 2; Write a function called square_root that receives a double-precision parameter x, computes, and returns the approximated value of the square root of x. Write a loop that repeats 20 times and computes 20 guess values, then returns the final guess after 20 iterations. Use the MIPS floating-point register convention (Section 9.6) to pass the parameter x and to return the function result. All computation should be done using double-precision floating-point instructions and registers. Compare the result of the sqrt.d instruction against the result of your square_root function. What is the error in absolute value?

solve in assembley language, MIPS Square Root Calculation: Newton’s iterative method can be used to approximate the square root of a number x. Let the initial guess be 1. Then each new guess can be computed as follows: guess = ((x/guess) + guess) / 2; Write a function called square_root that receives a double-precision parameter x, computes, and returns the approximated value of the square root of x. Write a loop that repeats 20 times and computes 20 guess values, then returns the final guess after 20 iterations. Use the MIPS floating-point register convention (Section 9.6) to pass the parameter x and to return the function result. All computation should be done using double-precision floating-point instructions and registers. Compare the result of the sqrt.d instruction against the result of your square_root function. What is the error in absolute value?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter6: Modularity Using Functions

Section6.4: A Case Study: Rectangular To Polar Coordinate Conversion

Problem 9E: (Numerical) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

Please write a function PythQuad(n) in python that generates a list of pythagorean quadruples (x,y,z,w) such that x <= y <= z <= w < n. Please do not use a triply nested loop, use the properties of a pythagorean quadruple to write the function.
3. Find Relatively Prime Write a function to return a number that is relatively prime with the given number. /* return an integer that is relatively prime with n, and greater than 1i.e., the gcd of the returned int and n is 1 Note: Although gcd(n,n-1)=1, we don't want to return n-1*/int RelativelyPrime (int n) 4. Find Inverse Then implement the following function, which returns the inverse modulo, and test it.Note that you need to check whether a and n are relative prime before calling thisfunction. Recall that a and n are relatively prime means that gcd(a,n)=1, i.e., theirgreatest common divisor is 1. Also recall that the extended Euclidean Algorithm canfind the integer s and t for a and n such that as+nt=gcd(a,n), where s is the inverseof a modulo n. /* n>1, a is nonnegative *//* a<=n *//* a and n are relative prime to each other *//* return s such that a*s mod n is 1 */int inverse (int a, int n){int s, t;int d = ExtednedEuclidAlgGCD (n, a, s, t);if (d==1){return (mod (t,…
1. Write a program uses a Boolean-valued function to determine whether a set of numbers is in a given range. a) Define a function, isInRange(x) with an integer parameter. b) isInRange(x) returns true if the integer number x is in the range (-100, 100). Otherwise, return false.c) Define a main() function, in which a loop will be created to do the following ten times: 1) get a random integer, n, in the range (-500, 500). 2) call isInRange(x) function to determine and print out if the number n is in the range. d) Call main() function to initiate the tasks to be performed. Output Example: 2 is in the range.66 is in the range.171 is not in the range. 67 is in the range.-28 is in the range.355 is not in the range. 343 is not in the range. 233 is not in the range. -263 is not in the range. 11 is in the range. 2. Write a program that sums up all positive user input numbers. a) For every iteration output the sum of all positive input values.b) Implement the loop to stop if a negative…
C++ - Rolling a single six-sided die produces a random number between 1 and 6 with a uniform distribution. Rolling two dice produces a number between 2 and 12 with a binomial distribution. In this lab you will simulate a number of dice rolls and graph the number of occurrences of each value. 1) Create a function called rollDie() that takes no parameters, and returns a random value between 1 and 6. Do not seed the random number generator in this function. int rollDie() 2) Create a function called initArray() that takes a data array and the size of the array as parameters and fills each element with the summed results of rolling two dice. Do not assume that the data array has been initialized. void initArray(int data[], int size) 3) Create a function called sortArray() that takes an array and the size of the array as parameters, and sorts the array using the sediment sort. void sortArray(int data[], int size) The sediment sort works as follows: start with the second element in the array…
Write and test the “digit” function: Function Prototype: int digit(int n,int k)This function returns the kth digit of the positive integer n. For example, if n is the integer 29,415 that is entered by user , then the call digit(n,0) would return the digit 2, and the call digit(n,2) would returnthe digit 4. do this only by using functions and loops. arrays are not allowed. example :Input: n = 29415 , k = 1 output: 9 Input: n = 2 , k = 1 output: index out of bound (return -1)
In loop functions.py, define a function named permutations that takes two paramters, n and r, in that order. This function returns the number of different permutations of length r from set of size n. Essentially to calculate these permutations, the function should compute the product (n - r+1)*(n-r+2)*(n-r+3)*...*(n-2)*(n-1) or n!/(n-r)!. No if statements or built in math functions should be used. For or while loops are best reccomended.
Modify c so that the function delay takes an int cycles as an argument. The for loop in delay executes cycles times, not a fixed value of 1,000,000. Then modify main so that the first time it calls delay, it passes a value equal to MAXCYCLES. The next time it calls delay with a value decreased by DELTACYCLES, and so on, until the value is less than zero, at which time it resets the value to MAXCYCLES. Use #define to define the constants MAXCYCLES as 10,000,000 and DELTACYCLES as 100,000.
code in python (A) please Solve the so-called "Birthday Problem". Write a program that takes an integer ?N and uses the function np.random.randint (low = 0, high = N) from numpy to generate a random sequence of integers between 00 and ?−1N−1. Run experiments to validate the hypothesis that the number of integers generated until the first repeated value is approximately ?∗?2⎯⎯⎯⎯⎯⎯⎯√π∗N2. a) Write a function birthday(N) that returns the number of values generated until a value is repeated as a function of the range of possible values ?N (from 00 to ?−1N−1); b) Write a function birthday_sim(N) that repeats birthday(N) a total of n_sim = 20000 times and returns the average of all the numbers generated; c) Show on one plot that as ?N increases (with a doubling experiment), from ?=2N=2 to ?=1000N=1000, the value of birthday_sim(N) approaches ?∗?2⎯⎯⎯⎯⎯⎯⎯√π∗N2.
Programming Assignment:Here is a loop that starts with an initial estimate of the square root of a, x, and improves it until itstops changing:while True: y = (x + a / x) / 2 if abs(y - x) < epsilon: break x = ywhere epsilon has a value like 0.0000001 that determines how close is close enough.Encapsulate this loop in a function called square_root that takes a as a parameter, chooses areasonable value of x, and returns an estimate of the square root of a.To test the square root algorithm in this chapter, you could compare it with math.sqrt. Write afunction named test_square_root that prints a table like this:1.0 1.0 1.0 0.02.0 1.41421356237 1.41421356237 2.22044604925e-163.0 1.73205080757 1.73205080757 0.04.0 2.0 2.0 0.05.0 2.2360679775 2.2360679775 0.06.0 2.44948974278 2.44948974278 0.07.0 2.64575131106 2.64575131106 0.08.0 2.82842712475 2.82842712475 4.4408920985e-169.0 3.0 3.0 0.0The first column is a number, a; the second column is the square root of a computed with the[your…
Transcribed Image Text About initial programming in python: Consider the series: 8. 1)" 1 = 1- 3 1 1 1 2n | 1 n=0 whose sum converges ton/4 That is: П lim s, = a) Write a function that, given n, calculates the sum of the series up to term n. b) Write a function that calculates the sum of the series with an error of less than O.01, that is, calculate the sum of the series series such that |Sn-N/4| < O. 01. Your function must also return the number of terms necessary to reach this error, that is, your function will return a tuple with the two calculated values. Important: It is mandatory to use the function defined in the previous item. Hint: math.fabs(number) returns the absolute value (module) of a number.
Please write a function PythQuad(n) in python that generates a list of pythagorean quadruples (x,y,z,w) such that x <= y <= z <= w < n. A pythagorean quadruple states that x^2 + y^2 + z^2 = w^2. Please do not use a triply nested loop, use the properties of a pythagorean quadruple to write the function.
Given two integers x snf y, the following recurrsive definition determined the greatest common divisor of x and y, Write gcd(xy). Write a recursive function, gcd, that takes two integers as parameters and returns the greatest commmon divisorof numbers.Also write a program to test your function. Write a recursive function,reverseDigits, that takes an integer as a parameter snd returns the number with the digits reversed. Also write a program to test your application.