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.
The 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 5
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
- A little child is studying arithmetic. They have just learned how to add two integers, written one below another, column by column. But the child always forgets about the important part - carrying. Given two integers, your task is to find the result that the child will get.arrow_forwardDescription A mathmatician Goldbach's conjecture: any even number(larger than 2) can divide into two prime number’s sum.But some even numbers can divide into many pairs of two prime numbers’ sum. Example:10 =3+7, 10=5+5, 10 can divide into two pairs of two prime number. Input Input consist a positive even number n(4<=n<=32766). Output Print the value of how many pairs are this even number can be divided into. Sample Input 1 1234 Sample Output 1 25arrow_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_forward
- A 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_forwardGuessing Numbers---The problem is to guess what number a computer has in mind. You will write a program that randomly generatesan integer between 0 and 100, inclusive. The program prompts the user to enter a number continuously until the number matches the randomly generated number. For each user input, the program tells the user whetherthe input is too low or too high, so the user can make the next guess intelligently. Here is a sample run . (do it using while or do-whGuessing Numbers---The problem is to guess what number a computer has in mind. You will write a java program that randomly generates an integer between 0 and 100, inclusive. The program prompts the user to enter a number continuously until the number matches the randomly generated number. For each user input, the program tells the user whetherthe input is too low or too high, so the user can make the next guess intelligently. Here is a sample run . (do it using while or do-while)arrow_forwardWrite a program that picks four cards from a deck of 52 cards and computes their sum. An ace, king, queen, and jack represent 1, 13, 12, and 11, respectively. Your program should display the number of picks that yieldthe sum of 24.arrow_forward
- Write a program that first reads the value n, which is the number of numbers to average. It should then read the n positive (float) numbers, average them, and display the average. ENTRYAn integer n and then the n floating numbers EXIT The average of the n numbers read. Example of program execution: Input 3 Entry 2.5 Entry 3.8 Entry 4.6 Output3.633333333333333arrow_forwardWrite a program that accepts a set of integer numbers. Your program should count the number of even numbers and find the maximum even. Use -1 to stop your data entry. Sample Input/ Output: Enter integer numbers, Use -1 to stop your data entry. 12 33 66 -1 There are 2 even numbers. The maximum even number is 66.arrow_forwardA Fibonacci sequence is a sequence of numbers where each successivenumber is the sum of the previous two. The classic Fibonacci sequencebegins: 1, 1, 2, 3, 5, 8, 13, .... Write a program that computes the nthFibonacci number where n is a value input by the user. For example, ifn = 6, then the result is 8.arrow_forward
- A formula for finding the greatest common divisor (GCD) of two numbers was formulated by the mathematician Euclid around 300 BCE. The GCD of two numbers is the largest number that will divide into both numbers without any remainder. For example, the GCD of 12 and 16 is 4, the GCD of 18 and 12 is 6.The basic algorithm is as follows:Assume we are computing the GCD of two integers x and y. Follow the steps below:1. Replace the larger of x and y with the remainder after (integer) dividing the larger number by the smaller one.2. If x or y is zero, stop. The answer is the nonzero value.3 If neither x nor y is zero, go back to step 1.Here is an example listing the successive values of x and y: x y135 20 %(135 / 20) = 15 15 20 %(20 / 15) = 5 15 5 %(15 / 5) = 0 0 5 GCD = 5 Write a recursive method that finds the GCD of two numbers using Euclid’s algorithm. public class Arithmetic{ public static int gcd(int a, int…arrow_forwardWrite a program that reads an integer and displays all its smallest factors, also known as prime factors. For example, if the input integer is 120, the output should be as follows: 2, 2, 2, 3, 5arrow_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: Compute the remainder of dividing the larger number by the smaller number. Replace the larger number with the smaller number and the smaller number with the remainder. 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_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Java random numbers; Author: Bro code;https://www.youtube.com/watch?v=VMZLPl16P5c;License: Standard YouTube License, CC-BY