(This is a version of Programming Project 2.1 from Chapter 2.) The Babylonianalgorithm to compute the square root of a positive number n is as follows:1. Make a guess at the answer (you can pick n/2 as your initial guess).2. Compute r = n / guess.3. Set guess = (guess +r) / 2.4. Go back to step 2 until the last two guess values are within 1% of each other. Write a program that inputs a double for n, iterates through the Babylonian algo-rithm until the guess is within 1% of the previous guess and outputs the answer as a double to two decimal places. Your answer should be accurate even for largevalues of n.

(This is a version of Programming Project 2.1 from Chapter 2.) The Babylonianalgorithm to compute the square root of a positive number n is as follows:1. Make a guess at the answer (you can pick n/2 as your initial guess).2. Compute r = n / guess.3. Set guess = (guess +r) / 2.4. Go back to step 2 until the last two guess values are within 1% of each other. Write a program that inputs a double for n, iterates through the Babylonian algo-rithm until the guess is within 1% of the previous guess and outputs the answer as a double to two decimal places. Your answer should be accurate even for largevalues of n.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

I want you to express the middle square method with the Racket program. In the square extraction method, when the number of digits of the generated random number is n, the square of the initial value s is calculated, and that value is regarded as a 2n digit number (the number of digits squared as shown in the example below). If is not enough, 0 is added.) The n numbers in the center are used as the first random number. Next, square this random number and take the n numbers in the center in the same way to make the next random number.
Write a program which reads two integers and prints out the sum, the differenceand the product. Divide them too, printing your answer to two decimal places.Also print the remainder after the two numbers are divided. Introduce a test to ensure that when dividing the numbers, the second number isnot zero
Write a program that takes in an integer in the range 20-98 as input. The output is a countdown starting from the integer, and stopping when both output digits are identical. Ex: If the input is 93, the output is: 93 92 91 90 89 88 Ex: If the input is 77, the output is: 77 Ex: If the input is not between 20 and 98 (inclusive), the output is: Input must be 20-98 For coding simplicity, follow each output number by a space, even the last one. Use a while loop. Compare the digits; do not write a large if-else for all possible same-digit numbers (11, 22, 33, ..., 88), as that approach would be cumbersome for large ranges.
Write a program that reads 10 numbers, finds the largest number, prints it, finds the smallest number, and prints it
In Java Sound power level is expressed in decibels. A decibel is 10 x log10(picoWatts),where a picoWatt is 10-12 Watts. To determine the acoustical power levelproduced by the combination of two sound sources, we do the following:1. Convert each decibel level into picoWatts, using the formula, picoWatts =10(decibels / 10)2. Add the picoWatt powers.3. Convert the sum back into decibels.Using good style, create a class called Decibels. In the main method, declare twocomponent decibel values, dB1 and dB1, both double variables. Also declare acombined decibel value, combinedDB. Prompt for and input the two componentdecibel values. Then use the above formulas and Math’s pow method and Math’slog10 method to compute the combined sound power level. Enter first decibel level: 63Enter second decibel level: 65Combination decibel level = 67.1244260279434 dBimport java.util.Scanner;public class Decibels{ public static void main(String[] args) { Scanner stdIn = new Scanner(System.in); double dB1,…
Write a program that reads HAND_SIZE cards from the user, then analyzes the cards and prints out the type of poker hand that they represent. (HAND_SIZE will be a global constant, typically 5, but your program must still work if it is set to something other than 5.) Poker hands are categorized according to the following hand-types: Straight flush, four of a kind, full house, straight, flush, three of a kind, two pairs, pair, high card. To simplify the program we will ignore card suits, and face cards. The values that the user inputs will be integer values from LOWEST_NUM to HIGHEST_NUM. (These will be global constants. We'll use LOWEST_NUM = 2 and HIGHEST_NUM = 9, but your program must work if these are set to something different.) When your program runs it should start by collecting HAND_SIZE integer values from the user and placing the integers into an array that has HAND_SIZE elements. It might look like this: Enter 5 numeric cards, no face cards. Use 2 - 9. Card 1: 8 Card 2: 7 Card…
Write a program that reads HAND_SIZE cards from the user, then analyzes the cards and prints out the type of poker hand that they represent. (HAND_SIZE will be a global constant, typically 5, but your program must still work if it is set to something other than 5.) Poker hands are categorized according to the following hand-types: Straight flush, four of a kind, full house, straight, flush, three of a kind, two pairs, pair, high card. To simplify the program we will ignore card suits, and face cards. The values that the user inputs will be integer values from LOWEST_NUM to HIGHEST_NUM. (These will be global constants. We'll use LOWEST_NUM = 2 and HIGHEST_NUM = 9, but your program must work if these are set to something different.) When your program runs it should start by collecting HAND_SIZE integer values from the user and placing the integers into an array that has HAND_SIZE elements. It might look like this: Enter 5 numeric cards, no face cards. Use 2 - 9. Card 1: 8 Card 2: 7 Card…
Write a program that outputs all the integers between 100 and 1000 (inclusive), that are divisible by 5 and also 6. (This means start at 100 and go up to 1000, but only output integers that are divisible by both 5 and 6.) Remember what "divisible" means - if a number is divisible by 5, there is no remainder when you divide it by 5. If a number is divisible by 6, there is no remainder when you divide it by 6. In java
The following code is to be done on Python: To play the UP Lotto, you buy a ticket that has five numbers in the range of 1–69,and a “UP Bonus” number in the range of 1–26. (You can pick the numbers yourself, or you can let the ticket machine randomly pick them for you.) Then, on a specified date, a winning set of numbers is randomly selected by a machine. If your first five numbers match the first five winning numbers in any order, and your UP Bonus number matches the winning Bonus number, then you win the UP LOTTO!, which is a very large amount of money. If your numbers match only some of the winning numbers, you win a lesser amount, depending on how many of the winning numbers you have matched. This data file has the list of the winning UP Lotto numbers that were selected between 2/2010 and 9/2023. Each line in the file contains the set of six numbers that were selected on a given date. The numbers are separated by commas, and the last number in each line is the UP Bonus number for…
Write a program that reads a number and finds it is a prime or not. 0. A prime number is a number such that 1 and itself are the only numbers that evenly divide it. For example: 3, 5,7, 11, 13, 17. 2.
Write a program that deals a number of cards (their numerical values) to a player's hand. To begin, the program asks the player for the values of the deck of cards. Then, the program deals the first two cards of the deck to a player's hand, and asks him if he wants another card. If he does not want a card, the program ends. If he wants a card, the program deals the next available card in the deck, adds it to the player's hand, and asks the player if he wants another card. The dealing process repeats as long as the user continues to accept cards, or until the cards in the deck run out. Card dealing involves copying the available card from the deck vector to another vector, which stores the player's hand, at the next available position. Assume that the deck of cards consists of only 10 cards with numerical values from 1 to 10, which the player will enter by keyboard before the program deals. The following functions must be implemented/used: enterDeckValues. - This…
What is the probability that in a classroom of x people, at least 2 will be born on the same day of the year (ignore leap year)? Use a Monte Carlo Simulation and a frequency table to write a program that calculates this probability, where the number of people (x) in the simulated class is given by the user. The probability for a class of size 23, should be right around 50%. NO language of "break" or "true" please! Please use the outline given below for the code: