Question

Using java programming. Question 1. Write a recursive function fibo(n) that returns the nth Fibonacci number...

Using java programming.

Question 1. Write a recursive function fibo(n) that returns the nth Fibonacci number which is defined as follows:

fibo(0) = 0 fibo(1) = 1 fibo(n) = fibo(n-1) + fibo(n-2) for n >= 2

Question 2. Write a recursive function that calculates the sum of quintics: 1power of5 + 2power of5 + 3power of5 + … + n5

Question 3. Write a program to find a route from one given position to another given position for the knight that takes a given number of moves. It works as in the following examples:

Example 1: Enter the start position: d2

Enter the end position: b8

Enter number of moves: 2

No route found.

Example 2: Enter the start position: d2

Enter the end position: b8

Enter number of moves: 4

Route found: d2, c4, b6, d7, b8.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

1.

int fibo(int n)
   {
       if(n==0)
       return 0;
       if(n==1)
       return 1;
       else
       {
           return fibo(n-1)+fibo(n-2);
       }
   }

1 2 3 import java.io.BufferedReader; import java.io.*; class fibonacci in public static void main (String[] args) throws IOEx

1 2 3 import java.io.BufferedReader; import java.io.*; class fibonacci in public static void main (String[] args) throws IOEx

Add a comment
Know the answer?
Add Answer to:
Using java programming. Question 1. Write a recursive function fibo(n) that returns the nth Fibonacci number...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • CH Question 1. Implement a recursive method fibo that takes an integer num as a parameter...

    CH Question 1. Implement a recursive method fibo that takes an integer num as a parameter and returns the nth Fibonacci number. Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, ... is an infinite sequence, where first 2 numbers are 1 and every subsequent number is equivalent to the sum of the previous two. Question 2. Implement a recursive method mult that takes two positive integer parameters, x and y and returns their product For example mult(2,3) returns 6....

  • 1. Write an iterative C++ function that inputs a nonnegative integer n and returns the nth...

    1. Write an iterative C++ function that inputs a nonnegative integer n and returns the nth Fibonacci number. 2. Write a recursive C++ function that inputs a nonnegative integer n and returns the nth Fibonacci number.

  • In Haskell: Write a recursive function fibonacci that computes the n-th Fibonacci number. fibonacci :: Int...

    In Haskell: Write a recursive function fibonacci that computes the n-th Fibonacci number. fibonacci :: Int -> Int Write a recursive function myProduct that multiplies all the numbers in a list. myProduct :: [Integer] -> Integer Using the technique of List Comprehension write a function that would remove even numbers from a list of lists. For Example: given input: [[1,2,3,4], [6,3,45,8], [4,9,23,8]] expected output: [[1,3], [3,45],[9,23]]. Show how the library function replicate :: Int -> a-> [a] that produces a...

  • Write a program in MIPs Assembly Language to compute nth number of a fibonacci number sequence....

    Write a program in MIPs Assembly Language to compute nth number of a fibonacci number sequence. Your program should prompt for an integer input n from the user. The program should call a recursive function to compute the nth fibonacci number. Your program must follow programming convention. You should submit program and screenshot of output in a single word/pdf file. You should use following recursive definition of fibonacci function: fib(0) = 0 fib(1) = 1 fib(n) = fib(n-1) +fib(n-2)

  • Fibonacci Sequence The Fibonacci Sequence is the series of numbers: 0, 1, 1, 2, 3, 5,...

    Fibonacci Sequence The Fibonacci Sequence is the series of numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ... The next number is found by adding up the two numbers before it. The 2 is found by adding the two numbers before it (1+1) The 3 is found by adding the two numbers before it (1+2), And the 5 is (2+3), and so on!         Example: the next number in the sequence above is 21+34 = 55 Source:...

  • The following is a correct implementation of a non-recursive method to find the nth Fibonacci number...

    The following is a correct implementation of a non-recursive method to find the nth Fibonacci number in Java: public static long fib(int n){    long[ ] fibNums = new long[n + 1];    fibNums[0] = 0;    finNums[1] = 1;    for(int i = 2; i <= n; i++){       fibNums[i] = fibNums [i - 1] + finBums[i - 2]; } return fibNums[n]; } I am having trouble understanding the code. Why the creation of the long array make this...

  • Write an ARM assembly language subroutine (named nfibo) to calculate and return the n-th Fibonacci number....

    Write an ARM assembly language subroutine (named nfibo) to calculate and return the n-th Fibonacci number. Fibonacci numbers (or a Fibonacci sequence) are a series of numbers with a property that the next number in the series is a sum of previous two numbers. Starting the series from 0, 1 as the first two numbers we have 0, 1, (0 + 1) = 1, (1 + 1) = 2, (1 + 2) = 3, (2 + 3) = 5, (3...

  • The recursive definition of a Fibonacci Number is F(n) = F(n - 1) + F(n -...

    The recursive definition of a Fibonacci Number is F(n) = F(n - 1) + F(n - 2), where F(0) = 1 and F(1) = 1. What is the value of Fib(3)?

  • I need help with this code. Im using C++ coding. Non Recursive (iterative) Fibonacci Write a...

    I need help with this code. Im using C++ coding. Non Recursive (iterative) Fibonacci Write a program that uses a for loop to calculate a Fibonacci sequence (NOT RECURSIVE!!!) up to a given position, starting with position 0. This function defines a Fibonacci sequence: If the number is 0, the function returns a 0 If the number is 1, the function returns a 1 If the number is higher than 1, it returns the sum of the previous two numbers...

  • Read the following code, threaded recursive calculation of Fibonacci number of n: #include <stdio.h> #include <stdlib.h>...

    Read the following code, threaded recursive calculation of Fibonacci number of n: #include <stdio.h> #include <stdlib.h> #include <pthread.h> void *fib(void *arg); int main(int argc, char **argv){     int n = atoi(argv[1]);     printf("%d\n", (int)fib(n)); } void *fib(void *arg){     int n;     pthread_t thread1;     pthread_t thread2;     void *a;     void *b;     int c;     n = (int)arg;     if (n <= 0) return 0;     if (n == 1) return 1;     pthread_create(&thread1, NULL, fib, n-1);    ...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT