Absolute C++
6th Edition
ISBN: 9780133970784
Author: Walter Savitch, Kenrick Mock
Publisher: Addison-Wesley
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 1, Problem 8PP
The Babylonian
- Make a guess at the answer (you can pick n/2 as your initial guess).
- Compute
- Set guess
- Go back to step 2 for as many iterations as necessary. The more steps 2 and 3 are repeated, the closer guess will become to the square root of n.
Write a
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Write a program that counts the number of integers from 1 to M that are divisible by N. Use the sample run as guide. Note, that the program repeats until an invalid
input is encountered.
Sample run:
Program to count the number of integers from 1 to M that are divisible by N.
Enter M (>1): 3
Enter N (>1): 4
There are no integers from 1 to 3 that are divisible by 4.
Enter M (>1): 4
Enter N (>1): 2
There are 2 integers from 1 to 4 that are divisible by 2.
Enter M (>1): 4
Enter N (>1): 3
There is 1 integer from 1 to 4 that is divisible by 3.
Enter M (>1): -5
You have entered an invalid input. Program will now terminate.
Write a program that calculates the equivalent resistance of a circuit. n electrical resistors with
resistance values R1, R2,.., Rn are said to be connected in parallel if the same voltage is applied
across each. Their equivalent resistance Reg is related to the values R1, R2, ...,
Rn by:
1
1
1
1
+
+...+
R R R,
R.
"eq
Write a program that prompts the user to enter the resistance of n resistors. The user should
be prompted continuously by using a while loop until a zero or negative value is entered (the
program should count the number of resistors n entered by the user and store the values in an
array). Use another separate loop to print the resistance values entered by the user and the
equivalent resistance Reg. Test your program with R1= 1 kn, R2= 2 kn, R3= 4 kQ and R4= 8 kQ.
Eulers number e is used as the base of natural logarithm. It may be approximated using the formula
e=1/0!+1/1!+1/2!…1/(n-1)!+1/n!
When n is sufficiently large. Write a program that approximates e using a loop that terminates when the difference between the two successive values of e is less than 0.0000001.
Chapter 1 Solutions
Absolute C++
Ch. 1 - A metric ton is 35,273.92 ounces. Write a program...Ch. 1 - A government research lab has concluded that an...Ch. 1 - Workers at a particular company have won a 7.6 pay...Ch. 1 - Negotiating a consumer loan is not always...Ch. 1 - Write a program that determines whether a meeting...Ch. 1 - Prob. 6PPCh. 1 - One way to measure the amount of energy that is...Ch. 1 - The Babylonian algorithm to compute the square...Ch. 1 - The video game machines at your local arcade...Ch. 1 - Write a program that allows the user to enter a...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Write a loop equivalent to the for loop above without using .
C Programming Language
Which of the following statements are wrong? MyPriorityQueueObject q1 = new MyPriorityQueue(); MyPriorityQueueN...
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Consider the adage Never ask a question for which you do not want the answer. a. Is following that adage ethica...
Experiencing MIS
The computer player in Programming Project 10 does not play very well inthe number guessing game, since it only...
Problem Solving with C++ (10th Edition)
In Exercises 49 through 54, find the value of the given function. Math.Round(3.1279,3)
Introduction to Programming Using Visual Basic (10th Edition)
Following the bit-level floating-point coding rules, implement the function with the following prototype: / Com...
Computer Systems: A Programmer's Perspective (3rd Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- The Babylonian algorithm to compute the square root of a positive number n is asfollows:1. Make a guess at the answer (you can pick n/2 as your initial guess).2. Compute r = n / guess3. Set guess = (guess +r)/ 24. Go back to step 2 for as many iterations as necessary. The more you repeat steps2 and 3, the closer guess will become to the square root of n. Write a program that inputs a double for n, iterates through the Babylonian algo-rithm five times, and outputs the answer as a double to two decimal places. Your answer will be most accurate for small values of n.arrow_forwardThe greatest common divisor of two positive integers, A and B, is the largest number that can be evenly divided into both of them. Euclid's algorithm can be used to find the greatest common divisor (GCD) of two positive integers. You can use this algorithm in the following manner: 1. Compute the remainder of dividing the larger number by the smaller number. 2. Replace the larger number with the smaller number and the smaller number with the remainder. 3. Repeat this process until the smaller number is zero. The larger number at this point is the GCD of A and B. Write a program that lets the user enter two integers and then prints each step in the process of using the Euclidean algorithm to find their GCD. An example of the program input and output is shown below: Enter the smaller number: 5 Enter the larger number: 15 The greatest common divisor is 5arrow_forwardWrite a program that inputs a number and checks whether it is a perfect number or not. A perfect number is the number that is numerically equal to the sum of its divisors. For example, 6 is a perfect number because the divisors of 6 are 1, 2, 3 and 1+2+3=6arrow_forward
- Write a program that reads an integer and displays all its smallest factors in an increasing order. For example, if the input integer is 120, the output should be as follows: 2, 2, 2, 3, 5.arrow_forwardWrite a detailed code for Sum of Natural Numbers Using for..Loop in go lang programming language with detailed output for example of sum of natural number till 50. Answer with detailed code and output screenshot.arrow_forwardLet n be a nonnegative integer. The factorial of n, written n!, is defined by 0!=1, n! =1*2*3*...n if n >= 1. For example, 4! = 1*2*3*4 = 24. Write a program that prompts the user to enter a nonnegative integer and outputs the factorial of the number.arrow_forward
- Coupon collector is a classic statistic problem with many practical applications. The problem is to pick objects from a set of objects repeatedly and determine how many picks are needed for all the objects to be picked at least once. A variation of the problem is to pick cards from a shuffled deck of 52 cards repeatedly and find out how many picks are needed before you see one of each suit. Assume a picked card is placed back in the deck before picking another. Write a program to simulate the number of picks needed to get four cards from each suit and display the four cards picked (it is possible that a card may be picked twice).arrow_forwardCorrect answer will be upvoted else downvoted. Computer science. You are given an integer n. Check if n has an odd divisor, more noteworthy than one (does there exist such a number x (x>1) that n is separable by x and x is odd). For instance, assuming n=6, there is x=3. Assuming n=4, such a number doesn't exist. Input The primary line contains one integer t (1≤t≤104) — the number of experiments. Then, at that point, t experiments follow. Each experiment contains one integer n (2≤n≤1014). If it's not too much trouble, note, that the input for some experiments will not squeeze into 32-cycle integer type, so you should use no less than 64-digit integer type in your programming language. Output For each experiment, output on a different line: "Indeed" if n has an odd divisor, more noteworthy than one; "NO" in any case. You can output "YES" and "NO" regardless (for instance, the strings yEs, indeed, Yes and YES will be perceived as certain).arrow_forwardA regular polygon is an n-sided polygon in which all sides are of the same length and all angles have the same degree (i.e., the polygon is both equilateral and equiangular). The formula for computing the area of a regular polygon is Area = ( n * s2 ) / (4 * tan( π/n) Here, s is the length of a side. Write a program that prompts the user to enter the number of sides and their length of a regular polygon and displays its area.arrow_forward
- Make a program that asks for a width, and then prints a pyramid of that width. The pyramid must be of odd width, and if the user enters an even number the program should print "Please enter an odd number" and ask again. (It is ok if the program gives an error if the user enters a non-number). Example: Please enter the pyramid width 10Please enter an odd numberPlease enter the pyramid width 14Please enter an odd numberPlease enter the pyramid width 13 * *** ***** ******* ********* ************************ The first line should have 1 asterisk, the second 3, then 5, 7, 9 etc. The number of spaces before starting the asterisks is (n−i)/2 Where n is the width of the pyramid and i is the number of asterixes in the current line. Note that this is always a whole number, as n and i are odd and hence (n-i) is even.arrow_forwardWrite a program that reads an integer between 0 and 1000 and multiplies all the digits in the integer. For example, if an integer is 932, the multiplication of all its digits isarrow_forwardWrite a program that generates 50 random numbers such that the first number is between 1 and 2, the second is between 1 and 3, the third is between 1 and 4, . . . , and the last is between 1 and 51.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Java random numbers; Author: Bro code;https://www.youtube.com/watch?v=VMZLPl16P5c;License: Standard YouTube License, CC-BY