please use this Appendix 1 for solve 2.2 and 2.3 You are required to develop a Java program that implements all the required parts belov2.1 Create a new Java project using your IDE that will include a Java class calledMyRoot. Note: you can use the same name for the project name as well.2.2 Implement a Java method with the identifier "SquareRoot" that takes 1parameter of type integer and returns a double value that represents the squareroot of the parameter. Note: you must implement the square root functionyourself by using the bisection algorithm as explained in Appendix 1 and youshould NOT use any java.lang.Math function.2.3 Implement a Java method with the identifier "CubeRoot" that takes 1 parameterof type integer and returns a double value that represents the cube root of theparameter. Note: you must implement the cube root function yourself by usingthe bisection algorithm as explained in Appendix 1 and you should NOT use anyjava.lang.Math function. Appendix 1 (bisection algorithm)Indexradicand50radicalTo find the square root of a number N the bisection method works as follows:create 2 variables Left and Right, where Left = 0 and Right = numberStep 1Step 2Find the midpoint between Left and RightIf Midpoint * Midpoint < number, then modify the value of the Left to be thevalue of midpointOtherwise, modify the value of the Right to be the value of the Midpoint.Repeat step 2 as much as needed!For this TMA, you need to repeat step 2 only 5 times.Graphical Explanation of the bisection method for finding the square root of 50:Let L represent Left, R represent Right, and M represent MidpointL=0M=25R=5025* 25 > 50L=0M=12.5R= 2512.5* 12.5 > 50L=0M=6.25 R=12.56.25 * 6.25 < 50L=6.25R=12.59.375 * 9.375 > 50Now Left should be 6.25, Right should be 9.375 and the algorithm continues.To find the cube root of a number N the bisection method works as follows:Step 1If the radicand is negative, then create a new radicand that is the opposite of theoriginal number, which is positive!create 2 variables Left and Right, where Left = 0 and Right = numberStep 2Step 3Find the midpoint between Left and RightIf Midpoint * Midpoint * Midpoint < number, then modify the value of theLeft to be the value of midpointOtherwise, modify the value of the Right to be the value of the Midpoint.Repeat step 2 as much as needed!For this TMA, you need to repeat step 2 only 5 times.If the radicand is negative, the radical should be the negative value of the numberfound, otherwise the radical should be the number found.Step 4

According to the information given:- We have to create program to find out the Square root and cube…

You are required to develop a Java program that implements all the required parts belo 2.1 Create a new Java project using your IDE that will include a Java class called MyRoot. Note: you can use the same name for the project name as well. 2.2 Implement a Java method with the identifier "SquareRoot" that takes 1 parameter of type integer and returns a double value that represents the square root of the parameter. Note: you must implement the square root function yourself by using the bisection algorithm as explained in Appendix 1 and you should NOT use any java.lang.Math function. 2.3 Implement a Java method with the identifier "CubeRoot" that takes 1 parameter of type integer and returns a double value that represents the cube root of the parameter. Note: you must implement the cube root function yourself by using the bisection algorithm as explained in Appendix 1 and you should NOT use any java.lang.Math function.

You are required to develop a Java program that implements all the required parts belo 2.1 Create a new Java project using your IDE that will include a Java class called MyRoot. Note: you can use the same name for the project name as well. 2.2 Implement a Java method with the identifier "SquareRoot" that takes 1 parameter of type integer and returns a double value that represents the square root of the parameter. Note: you must implement the square root function yourself by using the bisection algorithm as explained in Appendix 1 and you should NOT use any java.lang.Math function. 2.3 Implement a Java method with the identifier "CubeRoot" that takes 1 parameter of type integer and returns a double value that represents the cube root of the parameter. Note: you must implement the cube root function yourself by using the bisection algorithm as explained in Appendix 1 and you should NOT use any java.lang.Math function.

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

Q: Does the Knapsack Problem with b=7994 and the following sequence have a solution?…

A: The rucksack Problem is a well-known optimization problem in which the objective is to ascertain,…

Q: 6.2. Use the algorithm described in Proposition 6.5 to solve each of the following subset-sum…

A: The subset-sum problem is a computational problem in computer science and mathematics. It involves…

Q: Serbest he 14 Use Gauss-Jondan elimination to solve the following linear system Se-y-10 CA.20 08.09…

A: Here in this question we have given some linear equations and with using gauss jordan elimination…

Q: In Python, Solve using Least Squares method for linear regression given the following data points.…

A: We need to solve using Least Squares method for linear regression in Python for the given data…

Q: oach is applicable to optimiza

A: The greedy approach is applicable to optimization problems only.

Q: How does the concept of Polynomial-time hierarchy relate to NP-Complete problems?

A: The Polynomial-time hierarchy and NP-Complete problems are concepts within theoretical computer…

Q: What is the difference between Simple Hill Generate and Test algorithm Climbing

A: Simple Hill climbing algorithm is a local search algorithm which is used for optimizing the…

Q: The following questions will be based on the recurrence relation: T(n) = 16T([n/4]) + 3n if n > 4…

A: 1) Given equation is in the form of T(n)=aT(n/b)+nklogpn where a=16, b=4, k=1 and p=0, so masters…

Q: Complete the attached explicit and implicit ODE solvers with AB2 and the midpoint rule,…

Q: What is an NP-hard problem? Is every NP-hard problem NP-complete? Support your answer. Also, is…

A: The answer for the above question is given in the following step for your reference

Q: Input File The input file is a dataset containing addresses, neighborhoods and rent prices from 2020…

A: ANSWER:-

Q: 6. What are the two components that a problem needs to have in order to admit a greedy solution?

A: The answer is

Q: From the following code, explain how it works and calculate the time complexity def…

A: This code is a solution for the N-Queens problem using backtracking. The goal of the N-Queens…

Q: The cubic root of a number 44 can be found by solving x^2-44=0 using modified secant method.Starting…

Q: Given matrix represents following equations 3.0X1 + 2.0X2 – 4.0X3 = 3.0 2.0X1 + 3.0X2 + 3.0X3 = 15.0…

A: Algorithm: Partial pivoting: Find the kth pivot by swapping rows, to move the entry with the…

Q: Explain P, NP, NP Hard, and NP Complete problems. Give 2 examples (other than what is mentioned in…

A: P(polynomial) problem: P problems refer to problems where an algorithm would take a polynomial…

Q: Question 14 of 20: Seker te best an 14 Use Gauss-Jordan elimination to solve the following linear…

A: Gauss Jordan method is a matrix form method in which row reduced and element get eliminated…

Q: Find the density of cuboidal after taking volume of Cuboidal and mass of Cuboidal from user in php

A: your question is about finding the mass of cuboidal in PHP. let's see the code for this

Q: Solve. Check the solution. -7(y+2)+4(3y-6)=4(y-6)+13

A: Given:- -7(y+2)+4(3y-6)=4(y-6)+13 Solution: First, let's expand the expressions…

Q: Write a code in python to solve it..Start and end points are mentioned above

A: The Depth-first search algorithm is a simple approach to generating a maze. It is well described and…

Q: By using python in Jupyter notebook. What is the determinant of A? A= 30 0 -4 -1 2 4 9 7 -6 2-1 5

A: Since determinants can be found only for square matrices, we can ignore the last column of matrix A…

Q: Using a PYTHON code solve dy dt over the interval 0 ≤ t ≤ 2, with a step size of 0.5 implementing…

A: In this question we have to write a python code to solve a given differential equation using three…

Q: What is Bresenham Line Drawing Algorithm? Write Algorithm for slope |m|<1.

A: The above question is solved in step 2 :-

Q: Find the Cubic Model: x y 20 10 60 18 80 26 120 32 A) what method will you use to find the…

Q: Make a plot of a circle with its center at (4.2, 2.7) and radius of 7.5. Add a title, legend, and…

A: The current scenario here is to plot a circle with its center and radius. As well as add a title,…

Question

please use this Appendix 1 for solve 2.2 and 2.3

You are required to develop a Java program that implements all the required parts belov
2.1 Create a new Java project using your IDE that will include a Java class called
MyRoot. Note: you can use the same name for the project name as well.
2.2 Implement a Java method with the identifier "SquareRoot" that takes 1
parameter of type integer and returns a double value that represents the square
root of the parameter. Note: you must implement the square root function
yourself by using the bisection algorithm as explained in Appendix 1 and you
should NOT use any java.lang.Math function.
2.3 Implement a Java method with the identifier "CubeRoot" that takes 1 parameter
of type integer and returns a double value that represents the cube root of the
parameter. Note: you must implement the cube root function yourself by using
the bisection algorithm as explained in Appendix 1 and you should NOT use any
java.lang.Math function.

Appendix 1 (bisection algorithm)
Index
radicand
50
radical
To find the square root of a number N the bisection method works as follows:
create 2 variables Left and Right, where Left = 0 and Right = number
Step 1
Step 2
Find the midpoint between Left and Right
If Midpoint * Midpoint < number, then modify the value of the Left to be the
value of midpoint
Otherwise, modify the value of the Right to be the value of the Midpoint.
Repeat step 2 as much as needed!
For this TMA, you need to repeat step 2 only 5 times.
Graphical Explanation of the bisection method for finding the square root of 50:
Let L represent Left, R represent Right, and M represent Midpoint
L=0
M=25
R=50
25* 25 > 50
L=0
M=12.5
R= 25
12.5* 12.5 > 50
L=0
M=6.25 R=12.5
6.25 * 6.25 < 50
L=6.25
R=12.5
9.375 * 9.375 > 50
Now Left should be 6.25, Right should be 9.375 and the algorithm continues.
To find the cube root of a number N the bisection method works as follows:
Step 1
If the radicand is negative, then create a new radicand that is the opposite of the
original number, which is positive!
create 2 variables Left and Right, where Left = 0 and Right = number
Step 2
Step 3
Find the midpoint between Left and Right
If Midpoint * Midpoint * Midpoint < number, then modify the value of the
Left to be the value of midpoint
Otherwise, modify the value of the Right to be the value of the Midpoint.
Repeat step 2 as much as needed!
For this TMA, you need to repeat step 2 only 5 times.
If the radicand is negative, the radical should be the negative value of the number
found, otherwise the radical should be the number found.
Step 4

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!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Code:-

VIEW

Output:-

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 6 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

need the solve in python language with details and unique
Identify the base case(s) of the puzzle method
Which of the following algorithms can be used to find the optimal solution of an ILP?(a) Enumeration method;(b) Branch and bound method;(c) Cutting plan method;(d) Approximation method.
[a] Prove that the "Bin Packing Problem" (BPP) is NP-Complete. Like the rest of the exam, you may use online resources but should cite your source and summarize the proof in your own words. [b] Write an approximation algorithm for the online version of BPP that randomly considers up to three partially filled bins, and if none have room, then create a new bin and use that. [c] What modification to your solution in [b] would you recommend to solve the offline version of BPP. [d] In light of your prior knowledge of and experience with approximation algorithms for BPP, provide a reasonable estimate of the error bound
The following questions will be based on the recurrence relation: T(n) = 16T([n/4])+ n! if n > 4 T(n) = 1 if n < 4 Master.Method.5.a.b.k: What is the value of a, b, and k? Variable Coefficient b k Master.Method.5.simplified: Does the simplified master method apply? Master.Method.5.case: What case of the Master Method applies? Master.Method.5.Asymptotic: What is the asymptotically tight bound? Enter an expression
There is a whole field of math called non-linear optimization and the nature of that field is very similar to what is described for the wicked problems. Imagine you have a graph with tons of peaks and valleys and you are required to find the local minimum for that graph. Firstly: How will you find that? then how do you know what you have the actual local minimum? There are many techniques for such things which is beyond the scope of that course but simulated annealing is one such approach as we try to borrow from physics to help solve some of these problems.
explain otherwise downvote
Identify the general case(s) of the puzzle method
Use python to find the roots i) Write your own root-solver from scratch AND ii) Solve by using the built-in scipy solver called “fsolve”.
use Maple or Python - DON'T solve by hand use part 1 data for part 3, but DON'T solve part 1, which is also known as 3.1.1
Can you post the code to solve these?
Which of these statements is true for the branching factor for the Game of TicTacToe starting from initial state of empty board? Branching factor increases as the game progresses Branching factor decreases as the game progresses Branching factor is constant as the game progresses Branching factor at the start of the game is 4 ☐