Question

Assignment
This Programming Project deals two well-known arithmetic calculations that can be
implemented recursively.
The project will have 3 class files:
FactorialClass.java
FibinnaciClass.java
RecursionMainClass.java
The FactorialClass.java will calculate a factorial for a long type argument to a FactorialClass
class method.
The FibinnaciClass.java will calculate the Fibonacci sum for an int type argument to a
FibinnaciClass class method.
Both classes should display the results in a well formatted manner. See the sample output below
for required formatting details, use commas and right justification in the number results for both
calculations.
Each of the calculation classes should detect overflow using the Exception class try-catch
technique described in the book and slides (result <= 0). The overflow exception must cause the
parameter that caused the overflow and the overflow value to be displayed.
In a main program, write a loop for each calculation that will use inputs from 1 to a number that
will cause overflow. The loop for each calculation should display each result up until the
overflow happens.

Answer 1

Screenshot of the code:

//FactorialClass.java

//FibinnaciClass.java

//RecursionMainClass.java

Sample Output:

Code to copy:

//FactorialClass.java

package arithmetic;

//Define the class FactorialClass .

public class FactorialClass

{

//Define the method factorial().

public static long factorial(long n) throws Exception

{

//Declare the variable fact of long type.

long fact;

  

//If number of elements are zero than factorial is 1.

if (n == 0)

{

fact = 1;

}

  

//Number of elements are not 0.

else

{

//Find the factorial using recursion.

fact = n * factorial (n-1);

  

//Throw the exception if factorial is less

//than zero.

if (fact < 0)

{

throw new Exception(String.format("\n%d "

+ "Factorial = %,d"

+ " - This is Overflow\n",

n, fact));

}

}

  

//Return factorial.

return fact;

}

}

//FibinnaciClass.java

package arithmetic;

//Define the class FibinnaciClass

public class FibinnaciClass

{

// Define the fibonnaci() method.

public static int fibonnaci(int n) throws Exception

{

// Declare the variable.

int fib;

// if the number of elements are less than 1

if (n <= 1)

{

fib = n;

}

// Number of elements are more than 1.

else

{

// Use recursion to find the fibonnaci numbers.

fib = fibonnaci(n - 1) + fibonnaci(n - 2);

// Throw exception, if the fibonnaci is

//less than 0.

if (fib < 0)

{

throw new Exception(String.format(

"\n%d Fibonnaci = %,d "

+ "- This is Overflow\n",

n, fib));

}

}

// Return fibonnaci numbers.

return fib;

}

}

//RecursionMainClass.java

package arithmetic;

//Create and define the class RecursionMainClass.

public class RecursionMainClass

{

// Start the main() method.

public static void main(String[] args)

{

// Start the for loop.

for (int i = 0; i < 25; i++)

{

// Start the try block for the factorial.

try

{

// Print the factorial of the ith number.

System.out.println(String.format

("%d Factorial = %,d", i,

FactorialClass.factorial(i)));

}

// Start the catch block.

catch (Exception a)

{

// Print the exception.

System.out.println(a);

// Break.

break;

}

}

// Start the for loop

for (int i = 0; i < 25; i++)

{

// Start the try block for fibonacci numbers.

try

{

// Print the fibonacci numbers.

System.out.println(String.format

("%d Fibonnaci = %,d", i,

FibinnaciClass.fibonnaci(i)));

}

// Start the catch block

catch (Exception a)

{

// Catch the exception.

System.out.println(a);

// Break.

break;

}

}

}

}