Square root Program plan: Filename: “SquareRootComputer.java” This program file is used to define a class “SquareRootComputer”. In the code, Import the required packages. Define a class “SquareRootComputer”. Define a method “main()”. Define an object “in” of class “Scanner”. Prompt the user to enter the number. Scan for the value. Print the square root of the number. Define a method “squareRoot()”. Call the method “squareRootGuess()” and return the value. Define a method “squareRootGuess()”. Define the variable “epsilon”. If ”Math.abs(x-g*g)” is less than “epsilon”, Return the value of “g”. If the condition is not true, Call the method “squareRootGuess()” recursively and return the value.

Question

Want to see the full answer?

Answer 1

Question

Chapter 13, Problem 13PE

Program Plan Intro

Square root

Program plan:

Filename: “SquareRootComputer.java”

This program file is used to define a class “SquareRootComputer”. In the code,

Import the required packages.

Define a class “SquareRootComputer”.

Define a method “main()”.

Define an object “in” of class “Scanner”.

Prompt the user to enter the number.

Scan for the value.

Print the square root of the number.

Define a method “squareRoot()”.

Call the method “squareRootGuess()” and return the value.

Define a method “squareRootGuess()”.

Define the variable “epsilon”.

If ”Math.abs(x-g*g)” is less than “epsilon”,

Return the value of “g”.

If the condition is not true,

Call the method “squareRootGuess()” recursively and return the value.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Answer the question fully and accurately by providing the required files(Java Code, Two output files and written answers to questions 1-3 in a word document)meaning question 1 to 3 also provide correct answers for those questions.(note: this quetion is not graded).

.NET Interactive Solving Sudoku using Grover's Algorithm We will now solve a simple problem using Grover's algorithm, for which we do not necessarily know the solution beforehand. Our problem is a 2x2 binary sudoku, which in our case has two simple rules: •No column may contain the same value twice •No row may contain the same value twice If we assign each square in our sudoku to a variable like so: 1 V V₁ V3 V2 we want our circuit to output a solution to this sudoku. Note that, while this approach of using Grover's algorithm to solve this problem is not practical (you can probably find the solution in your head!), the purpose of this example is to demonstrate the conversion of classical decision problems into oracles for Grover's algorithm. Turning the Problem into a Circuit We want to create an oracle that will help us solve this problem, and we will start by creating a circuit that identifies a correct solution, we simply need to create a classical function on a quantum circuit that…