2.7 The "divide and average" method, an old-time method for approximating the square root of any positive number a can be formulated as x = x + a/x 2 (a) Write well-structured pseudocode to implement this algorithm as depicted in Fig. P2.7. Use proper indentation so that the structure is clear. (b) Develop, debug, and document a program to implement this equation in either a high-level language or a macro language of your choice. Structure your code according to Fig. P2.7. F SquareRoot = 0 T a > 0 tol = 10-6 x = a/2 y = (x + a/x)/2 | = |(y = x)/y|| e x = y F e < tol T SquareRoot = x

2.7 The "divide and average" method, an old-time method for approximating the square root of any positive number a can be formulated as x = x + a/x 2 (a) Write well-structured pseudocode to implement this algorithm as depicted in Fig. P2.7. Use proper indentation so that the structure is clear. (b) Develop, debug, and document a program to implement this equation in either a high-level language or a macro language of your choice. Structure your code according to Fig. P2.7. F SquareRoot = 0 T a > 0 tol = 10-6 x = a/2 y = (x + a/x)/2 | = |(y = x)/y|| e x = y F e < tol T SquareRoot = x

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.3: Interactive While Loops

Problem 6E: (Conversion) a. Write a C++ program to convert meters to feet. The program should request the...

See similar textbooks

Similar questions

Problem C: Snake Eves on Crazy Dice Write a program that simulates rolling two twenty-sided dice 100000 times, counting now many times the sum of the two dice is 2. Based on these results as well as the results of the program (snakeeyes.py) shown in class, make a guess as to how often one can expect to roll snake-eyes (two Is) on a pair of dice labeled I through n, for any positive integer n. Sample Run You got snake-eyes 35 times out of 100000. That is .035 percent of the time. Roughly, that is 1 in 2857 times. Note: The numbers shown above are NOT realistic. This is just to show the format desired for your output. In Python Code
Python only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…
Part 1) Write pseudocode for an iterative algorithm which finds the maximum value of a list of integers. Use a loop invariant to prove your algorithm is correct. (Presumably you have already witten a program like this over the course of your studies! The interesting part here is the proof.)
Python only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…
1. [LO 1, LO 2, LO 3 & LO 4, Treasure Hunter Description You are in front of a cave that has treasures. The cave can be represented in a grid which has rows numbered from 1 to , and columns numbered from 1 to . For this problem, define (x,y ) as a tile that is in the the-x row and the y-row. There is a character in each tile, which indicates the type of that tile. Tiles can be floors, walls, or treasures which are represented respectively by the characters '.' (period), '#' (hashmark), and '*' (asterisk). You can go through the floor tiles and treasures, but you can't get past the wall tiles.Initially, you are in a tile (??, Sy). You want to visit all the treasure squares, and retrieve the treasure. When you visit a treasure tile, the treasure is instantly retrieved, and the tile turns into a floor.In a move, if you are on a tile (?,y), then you can move to the right tile above (?-1,y), right (?,y + 1), down (? + 1, ), and left (?, 1) of the current tile. The tile you visit must…
a. Following pseudocode on slide #30, implement a function to perform binary addition. The function takes two integers as inputs, and returns the binary representation of the sum of the two numbers as a string. Note that the addition has to be performed using the binary representations of the two integers, meaning you can not do '5+8 = 13' then return the binary representation of 13. Use the following pairs to test your code: (24,98), (2387482,1), (25,25) Binary Addition of Integers Algorithms for performing operations with integers using their binary expansions are important as computer chips work with binary numbers. Each digit is called a bit. procedure add(a, b: positive integers) {the binary expansions of a and b are (a-19-2.a) and (b-1b-2²b)₂ respectively} n-2' n-2' C:=0 for j:= 0 to n-1 d:= := [(a₁ + b₁ + c)/2] s, := a₁ +b+c=2d c:= d S := C return(s,S₁,...,s){the binary expansion of the sum is (SS-₁,5)₂} The number of additions of bits used by the algorithm to add two n-bit…
***in python only*** use turtle function Define the concentricCircles function such that: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the largest (i.e., outermost) circle, and then every other circle out to the edge alternates between that color and the 'other' color. The difference between the radii of subsequent circles is always the same, and this difference is also equal to the radius of the smallest circle. Put another way: the distance between the inside and outside of each ring is the same. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters Use any kind of loop Within the definition of concentricCircles with 4 parameters, use any kind of loop in at least one place. Call…
Computer Science c++ || urgent Write the code for choosing the list of items in order to get the maximum profit of fractional knapsack problem. [NOTE: number of input items should be user interest, and output should be like - firstly print the resulting profit table, and then print the all selected items (must not be all items from the inputted items - means that all inputted items should not be as the selected items) for the knapsack and then print the maximum profit.]
(2) Create an iterative and a recursive function in pseudo-code which calculates the ele- ments of the sequence given on the following drawing. The green numbers mean the index (Oth element, 1st element, 2nd element, etc.) and the black mean the actual va- lue. Note: I did not calculate all the values, just the "necessary" ones.: 27 2 2 7
How is the body of a for loop defined? A. The body of a for loop is defined by an indented block of code following the for statement, similar to the body of an if statement. B. The body of a for loop is defined by an opening curly brace, one or more lines of code and a closing curly brace. C. The body of a for loop is defined by a left parenthesis, one or more lines of code and a right parenthesis. D. For loops do not have a body. What is a for loop? A. The for loop is the new improved three loop as it was defined in Python version 2. B. The for loop enables a program to repeat a block of code multiple times. C. The for loop enables a program to repeat a block of code one time, much like the if statement. D. The for loop is a block of code included at the beginning (the for) of a program. Which of the following is an example of a sequence that might be used in a for statement? A. An integer B. A floating point number C. A list D. A boolean variable How is a…
4. The Fibonacci series: 0, 1, 1, 2,3,5,8,13,21... begins with terms 0 and 1 and has the property that each succeeding term is the sum of the two previous terms. Write a program containing a recursive function that computes and displays the nth Fibonacci number, given the value for n.
4. The Fibonacci series: 0, 1, 1, 2,3,5,8,13,21... begins with terms 0 and 1 and has the property that each succeeding term is the sum of the two previous terms. Write a program containing a recursive function that computes and displays the nh Fibonacci number, given the value for n.