Core Java - Interview Questions and Answers for 'Fibonacci' | Search Interview Question

Core Java - Interview Questions and Answers for 'Fibonacci' - 2 question(s) found - Order By Newest

Frequently asked in face to face interviews.

Q1. Write a program to print fibonacci series.

Ans. int count = 15;
int[] fibonacci = new int[count];
fibonacci[0] = 0;
fibonacci[1] = 1;
for(int x=2; x < count; x++){
fibonacci[x] = fibonacci[x-1] + fibonacci[x-2];
}

for(int x=0; x< count; x++){
System.out.print(fibonacci[x] + " ");
}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve ebay fibonacci series Asked in 66 Companies basic frequent}

Related Questions

What are the steps to be performed while coding Junit with Mocking framework ?

What is a Sequence File?

What different level of logging you use while coding ?

Have you ever encoded the response before sending it back from the service? If Yes , Which encoding was used ?

What are the different type of encoding you have used ?

How does encoding affect using Reader / writer classes or Stream classes in Java ?

What is the difference between html encoding and url encoding ?

Does spaces get's encoded in html encoding ?

Q2. Write a Program to print fibonacci series using recursion.

Core Java

Ans. public class FibonacciUsingRecursion {
   public static void main(String[] args) throws IOException{
      getNextFibanocci(1,1);
   }

   static int getNextFibanocci(int a,int b){
      if(a+b >= 100){
         return 0;
      } else {
         System.out.println(a+b);
         getNextFibanocci(b,a+b);
      }

      return 0;
   }
}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve fibonacci recursion}

Related Questions

What will happen if we don't have termination statement in recursion ?

Write a Program to print factorial of a number using recursion

Find Fibonacci first n numbers using recursion ?

Write an Algorithm for Graph Traversal ? The Graph has a loop.

Write a program to print sum of numbers between the start and end number

For example - Passing start number as 2 and end number as 10, it should print 2+3+4+5+6+7+8+9+10 = 54

Write a program using Recursion to print multiplication of numbers between the start and end number

For example - Passing start number as 2 and end number as 10, it should print 2*3*4*5*6*7*8*9*10 = 3628800

What is recursion in Java ?

What will happen if we don't have termination statement in recursion ?

Which of the two - iteration or recursion - is slower ?

Search Interview Questions

Help us and Others Improve. Please let us know the questions asked in any of your previous interview.