Question

How to Submit Please submit your answers to the lab instructor once you have completed. Failure to submit will result in a ZERO FOR THIS LAB. NO EXCEPTIONS.

1. Implement a method factorial(int n), that takes a number (int) and returns its factorial. Factorial of an integer is the product of all positive integers less than or equal to it. Method needs to be implemented using recursion.

2. Implement a method fibonacci(int n), that takes a number (int) and prints Fibonacci series up to a nth term. The Fibonacci series is a series where the next term is the sum of pervious two terms. The first two terms of the Fibonacci sequence is 0 followed by 1.

3. In main() method, create an array list of size 5, that contains the following values: 1, 3, 5, 7, 9. For each element in the array list, calculate factorial and Fibonacci series using methods from 1. and 2., and print the results. Note: use ‘for-each’ loop.

Answer 1

Answer:

Explanation:

Both the methods are defined as static inside Main class and then main() method defines an arraylist of 5 integers and uses a for each loop to call both the methods for each integer and print the output.

Code:

import java.util.ArrayList;

public class Main
{
public static int factorial(int n)
{
if(n==1 || n==0)
return 1;
  
return n*factorial(n-1);
}
  
public static void fibonacci(int n)
{
int a = 0;
int b = 1;
  
if(n==1)
System.out.print(a);
else
System.out.print(a+" "+b+" ");
  
int c;
  
for(int i=2; i<n; i++)
{
c = a+b;
a = b;
b = c;
  
System.out.print(c+" ");
}
}
   public static void main(String[] args) {
      
       ArrayList<Integer> arr = new ArrayList<Integer>();
      
       arr.add(1);
       arr.add(3);
       arr.add(5);
       arr.add(7);
       arr.add(9);
      
       for(Integer n: arr)
       {
       System.out.println(factorial(n));
       fibonacci(n);
       System.out.println();
       }
   }
}

Output:

PLEASE UPVOTE IF YOU FOUND THIS HELPFUL!