Core java - Interview Questions and Answers for '1to1help.net' | Search Interview Question - javasearch.buggybread.com

# Search Interview Questions

More than 3000 questions in repository.
There are more than 900 unanswered questions.
Have a video suggestion.
Click Correct / Improve and please let us know.
Label / Company      Label / Company / Text

Core java - Interview Questions and Answers for '1to1help.net' - 1 question(s) found - Order By Newest

 Q1. Find Fibonacci first n numbers using recursion ? Core Java
Ans. public int fibonacci(int n) {
if(n == 0)
return 0;
else
if(n == 1)
return 1;
else
return fibonacci(n - 1) fibonacci(n - 2);
}

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

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
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 ?
Write a Program to print fibonacci series using recursion.

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

Any input from you will be highly appreciated and It will unlock the application for 10 more requests.