In java with clear coding please, Thank you. **6.22067(Math: approximate the square root) There are several techniques for implement-ing the sqrt method in the Math class. One such technique is known as theBabylonian method. It approximates the square root of a number, n, by repeatedlyperforming a calculation using the following formula:nextGuess = (lastGuess + n / lastGuess) / 2When nextGuess and lastGuess are almost identical, nextGuess is theapproximated square root. The initial guess can be any positive value (e.g., 1).This value will be the starting value for lastGuess. If the difference betweennextGuess and lastGuess is less than a very small number, such as 0.0001,you can claim that nextGuess is the approximated square root of n. If not, next-Guess becomes lastGuess and the approximation process continues. Imple-ment the following method that returns the square root of n.public static double sqrt(long n)e

Answered: The following method that returns the…

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

See similar textbooks

Related questions

Question

In java with clear coding please, Thank you.

**6.22
067
(Math: approximate the square root) There are several techniques for implement-
ing the sqrt method in the Math class. One such technique is known as the
Babylonian method. It approximates the square root of a number, n, by repeatedly
performing a calculation using the following formula:
nextGuess = (lastGuess + n / lastGuess) / 2
When nextGuess and lastGuess are almost identical, nextGuess is the
approximated square root. The initial guess can be any positive value (e.g., 1).
This value will be the starting value for lastGuess. If the difference between
nextGuess and lastGuess is less than a very small number, such as 0.0001,
you can claim that nextGuess is the approximated square root of n. If not, next-
Guess becomes lastGuess and the approximation process continues. Imple-
ment the following method that returns the square root of n.
public static double sqrt(long n)
e

Expert Solution

Step 1

Program Approach:

1- As mentioned in the assignment, implement the sqrt method.
2- Need to import the Math package and the util package.
3- Util package is used to create the object of the scanner class.
4- Scanner class used to take the input from a user.
5- Create the method as mentioned in the assignment sqrt() with one parameter.
6- Invoke that method from the main method.
7- Prompt a message to take input from a user.
8- Create a variable as a number to store the value entered by a user.
9- Pass that value to the sqrt() method as a parameter.
10- That method will return the sqrt value and display the output on the screen.
11- Please check the following complete implementation of the sqrt() method and output screenshot.

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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