1. Create a class called Project8 and implement the following methods:

a. (factorial) write a method that calculates and return n!

b. (computing Π(pi)) You can approximate Π by using the following series:

Π = 4(1 – 1/3 + 1/5 – 1/7 + 1/9 – 1/11 + …. + 1/2n-1 – 1/2n+1)

Write a method called pi, that given n, calculates and return value of Π

c. (Approximating the square root) Implement the sqrt method. The square root of a number, 

num, can be approximated be repeatedly performing a calculation using the following 

formula:

nextGuess = (lastGuess + (num / lastGuess)) / 2

When next Guess and lastGuess are almost identical, nextGuess is the approximated square 

root.

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 

num. If not, nectGuess becomes lastGuess and the approximation process continues.

d. (Convert form decimal to other bases) Write a method that converts decimal numbers to 

other bases (binary, octal, hexadecimal).

The initial guess can be any positive value (e.g., 1). This value will be the starting value 

2. Write a main method to the following:
a. Calculates and prints value of Π for n=10000
b. Calculate and print square root of 16
c. Convert 125 to binary, octal, and hexadecimal

 

 

    • 10 years ago
    A+ Work
    NOT RATED

    Purchase the answer to view it

    • project8.zip