Give the correct output for the recursive code below: public class Fibonacci { public static void main(String] args) { // Recursive code int x= 10; System.out.println ("Fibonacci series from 1 to "+ x + " is " ); for (int i=1; i<=x; ++i) System.out.print (" " + fibonac(i)); System.out.printIn(); } public static int fibonac (int x) { if (k == 0) return 0; if (k == 1) return 1; return fibonac(x-1)+ fibonac(x-2); } Select one: a.Fibonacci series from 1 to 10 is 123 4 5 67 8 9 10 b.Fibonacci series from 1 to 10 is 136 10 15 21 28 36 45 55 C.Fibonacci series from 1 to 10 is 122 33 3 4 44 4 d.Fibonacci series from 1 to 10 is 1123 5 8 13 21 34 55

Give the correct output for the recursive code below: public class Fibonacci { public static void main(String] args) { // Recursive code int x= 10; System.out.println ("Fibonacci series from 1 to "+ x + " is " ); for (int i=1; i<=x; ++i) System.out.print (" " + fibonac(i)); System.out.printIn(); } public static int fibonac (int x) { if (k == 0) return 0; if (k == 1) return 1; return fibonac(x-1)+ fibonac(x-2); } Select one: a.Fibonacci series from 1 to 10 is 123 4 5 67 8 9 10 b.Fibonacci series from 1 to 10 is 136 10 15 21 28 36 45 55 C.Fibonacci series from 1 to 10 is 122 33 3 4 44 4 d.Fibonacci series from 1 to 10 is 1123 5 8 13 21 34 55

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

write a code in java (using recursion)
Question 31 Below is a recursive version of binary search, which was not presented in class. When calling this method (from the main or other method) what would need to be passed as actual parameters? 1) public static int binarySearch(intO a, int hi, int low, int mid, int x) { 2) if (low > hi) 3) return -1; 4) else if (a[mid] x). return mid; else if (x < a[mid]) return binarySearch(a,mid-1,low, (low+mid-1)/2,x); else return binarySearch(a,hi,mid+1, (mid+1+hi)/2,x); 10) } first parameter - an array to be searched second parameter - the length of the array minus 1 O third parameter - 0 forth parameter - (n-1)/2, where n is the length of the array O fifth parameter - the integer to be searched for O all of the above
Write a recursive method that gives the following pattern(Write in Java language) run : 1 2 4 7 11 16 22 29 37 46
Write a recursive method in java that sums all values between s and n inclusive /* assume s is less than or equal to n to start */ public static int sum(int s, int n) { }
Consider the following recursive method: Public static int Fib(int a1, int a2, int n){ if(n == 1) return a1; else if (n == 2) return a2;else return Fib(a1, a2, n-1) + Fib(a1, a2, n-2);} Please draw the recursion trace for Fib(2,3,5)
It is suspected that out of a set of 64 50p coins one of the coins is fake (i.e., lighter in weight than a genuine coin). With one weighing scale. (i)Give a detailed explanation on how you would go about determining the fake coin. (ii)What is the minimum number of times you need to use the scales to weigh the coins before identifying the fake coin? (iii)Write a recursive method that returns the value of N! (N factorial). Explain why you would not normally use recursion to solve this problem.
Write a program that has a main() function that calls a recursive method repeatPrint(String s, .....) that prints out the strings as shown in the example below: repeat Print ("CHICAGO", ....); C CH CHI CHIC CHICA CHICAG CHICAGO CHICAGO HICAGO ICAGO CAGO AGO GO 0
Write a recursive method to determine whether a String contains a 'q' not immediately followed by a 'u' (ignoring capitalization). In other words: • the word does contain at least one 'q' • and that q is followed by anything except a 'u' Carefully review the provided driver program to see example test cases. The method header is: public static boolean qNotFollowedByU(String word)
Try to do it asap
I have two questions: Is my programs code the most effective way at finding recursion or is there a much better and cleaner way? Why is the program showing 0 when I implement a number that depth is greater than 100? Shouldn't it show the number 1? Source code: package recursiveModule; public class RecursiveMethod { public static long calculateFactorial(int n, int depth) { if (depth > 100 || n <= 1) { return 1; } return n * calculateFactorial(n - 1, depth + 1); } public static void main(String[] args) { System.out.println("Factorial of 1 is " + RecursiveMethod.calculateFactorial(1, 0)); System.out.println("Factorial of 8 is " + RecursiveMethod.calculateFactorial(8, 0)); System.out.println("Factorial of 101 is " + RecursiveMethod.calculateFactorial(101, 0)); } }
Write a recursive method tripleChar(String s, char c) that takes a string s and a character c. The method returns the string s with all the occurrences of c repeated 3 times.