The square root of any number N>0 can be opproximated by repeated calculation using the formula N = squared_value NG - 0.5 (FG + N/FG) where NG stands for next guess and FG stands for first guess. The value of NG and FG are compared. If the two values are comparably close, then NG is the final answer. If the two values are off, NG becomes FG and the formula is used again to compute FG. After so many iterations, NG and FG will merge. a. Write a function that calculates the square root of a number using this method. The initial guess will be the starting value of EG (FG - 1). The function will compute a value for NG using the formula given and returns that value. (Change the name of the functions to something more meaningful) double fun_1 (double FG, double N); b. Write a function that prompts the user for any number N > 0, and returns that value back. The prototype is like follows: double fun_2 ( void ); C. Now inside the main function, check the difference between NG and FG to see whether these two guesses are almost identical. If they are, NG is accepted as the square root; otherwise, the next guess (NG) becomes the first guess (FG) and the process is repeated (another value is computed for NG, the difference is checked, and so on). The loop should be repeated until the difference (1 NG - FGI) is less than 5e-3. d. Test your square root function for the numbers 6, 120.5, 88, 36.01, 10000, and 0.25, ..
The square root of any number N>0 can be opproximated by repeated calculation using the formula N = squared_value NG - 0.5 (FG + N/FG) where NG stands for next guess and FG stands for first guess. The value of NG and FG are compared. If the two values are comparably close, then NG is the final answer. If the two values are off, NG becomes FG and the formula is used again to compute FG. After so many iterations, NG and FG will merge. a. Write a function that calculates the square root of a number using this method. The initial guess will be the starting value of EG (FG - 1). The function will compute a value for NG using the formula given and returns that value. (Change the name of the functions to something more meaningful) double fun_1 (double FG, double N); b. Write a function that prompts the user for any number N > 0, and returns that value back. The prototype is like follows: double fun_2 ( void ); C. Now inside the main function, check the difference between NG and FG to see whether these two guesses are almost identical. If they are, NG is accepted as the square root; otherwise, the next guess (NG) becomes the first guess (FG) and the process is repeated (another value is computed for NG, the difference is checked, and so on). The loop should be repeated until the difference (1 NG - FGI) is less than 5e-3. d. Test your square root function for the numbers 6, 120.5, 88, 36.01, 10000, and 0.25, ..
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Transcribed Image Text:The square root of any number N>0 can be opproximated by repeated calculation using the formula
N = squared_value
NG = 0.5 (FG + N/FG)
where NG stands for next guess and FG stands for first guess. The value of NG and FG are compared. If the
two values are comparably close, then NG is the final answer. If the two values are off, NG becomes FG and
the formula is used again to compute FG. After so many iterations, NG and FG will merge.
a. Write a function that calculates the square root of a number using this method. The initial guess will
be the starting value of FG (FG = 1). The function will compute a value for NG using the formula
given and returns that value. (Change the name of the functions to something more meaningful)
double fun_1 (double FG, double N);
b. Write a function that prompts the user for any number N > 0, and returns that value back. The
prototype is like follows:
double fun_2 ( void );
c. Now inside the main function, check the difference between NG and FG to see whether these two
guesses are almost identical. If they are, NG is accepted as the square root; otherwise, the next guess
(NG) becomes the first guess (FG) and the process is repeated (another value is computed for NG, the
difference is checked, and so on). The loop should be repeated until the difference (I NG - FGI) is
less than 5e-3.
d. Test your square root function for the numbers
6, 120.5, 88, 36.01, 10000, and 0.25,..
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 4 images
Recommended textbooks for you
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
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