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

Similar questions

explain otherwise downvote
Explain the difference between a P problem and an NP problem (aka P vs. NP)
using scilab scinotes and display the result - disp will be "mprintf"
please include all steps
I’m meeting help with part C of this problem which is finding a recursive solution. The first picture shows you the problem and the second picture is the recursive solution that I have developed which is not working. Any help would be appreciated.
Q2 Write the recurrence relation for the following method: findMax (A, left, right) { if (left == right) return A[left] else { max1 = findMax (A, left, (right + left) / 2) max2 = findMax (A, (right + left) / 2, right) if (maxl > max2) return maxl else return max2
Solve this with complete solution please
Apply the fully parenthesize form in the following expressions : X=10, Y=5, Z=3, W=2Ex. A - B + C( (A - B)+C)Solve based on the precedence 17. x&y18. x | w19. x^y20. (x!=x)21. ~x
Please include a detailed explanation on how to solve
What is the answer of Fib(1) + Fib(2) + Fib(3) + Fib(4) = ?
2. Recurrences (Master Method). Solve each recurrence below using the Master Method and write your answer using e-notation. Make sure that you show all your work including the corresponding case and the values of e or k used. If it is not possible to solve a recurrence using the Master Method, prove it by showing that the form is inapplicable or by showing that all 3 cases cannot be satisfied. (a) T(n)=37(n/2) + n² (b) T(n)=25T(n/5)+n (e) T(n)= T(3n/10)+n (d) T(n)= n³T(n) + 2n (e) T(n)= 3T(n/3) +n¹/3 (f) T(n)=9T(n/3) + n² lg n (g) T(n)=9T(n/3) + nlg²n (h) T(n)= T(n/3)+27 (n/5)+n (i) Bonus T(n) = 27 (√n) +logn