Analyze the behavior of the following program, which computes the nth Fibonacci number, for appropriate values of n. Obtain the frequency count of the statements (that are given line numbers) for various cases of n. 34 A Textbook of Data Structures and Algorithms 1 procedure Fibonacci (n) read (n); if (n<0) then print 1. 2-4. 5-7. ("error"); exit(); if (n=0) then print ("Fibonacci number is 0"); exit(); 8-10. if (n=1) then print ("Fibonacci number is 1"); exit(); 11-12. f1=0; f2=1; for i=2 to n do f = f1 + f2; 13. 14-16. f1 = f2; f2 = £; print("Fibonacci number is", f); end 17. 18. end Fibonacci

Analyze the behavior of the following program, which computes the nth Fibonacci number, for appropriate values of n. Obtain the frequency count of the statements (that are given line numbers) for various cases of n. 34 A Textbook of Data Structures and Algorithms 1 procedure Fibonacci (n) read (n); if (n<0) then print 1. 2-4. 5-7. ("error"); exit(); if (n=0) then print ("Fibonacci number is 0"); exit(); 8-10. if (n=1) then print ("Fibonacci number is 1"); exit(); 11-12. f1=0; f2=1; for i=2 to n do f = f1 + f2; 13. 14-16. f1 = f2; f2 = £; print("Fibonacci number is", f); end 17. 18. end Fibonacci

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

java C++ Ackermann’s FunctionAckermann’s Function is a recursive mathematical algorithm that can be used to test how well a computer performs recursion. Write a function A(m, n) that solves Ackermann’s Function. Use the following logic in your function:If m = 0 then return n + 1If n = 0 then return A(m−1, 1) Otherwise, return A(m−1, A(m, n−1))Test your function in a driver program that displays the following values:A(0, 0) A(0, 1) A(1, 1) A(1, 2) A(1, 3) A(2, 2) A(3, 2) SAMPLE RUN #0: ./AckermannRF Hide Invisibles Highlight: Show Highlighted Only The·value·of·A(0,·0)=·1↵ The·value·of·A(0,·1)=·2↵ The·value·of·A(1,·1)=·3↵ The·value·of·A(1,·2)=·4↵ The·value·of·A(1,·3)=·5↵ The·value·of·A(2,·2)=·7↵ The·value·of·A(3,·2)=·29↵
For function addOdd(n) write the missing recursive call. This function should return the sum of all postive odd numbers less than or equal to n. Examples: addOdd(1) -> 1addOdd(2) -> 1addOdd(3) -> 4addOdd(7) -> 16 public int addOdd(int n) { if (n <= 0) { return 0; } if (n % 2 != 0) { // Odd value return <<Missing a Recursive call>> } else { // Even value return addOdd(n - 1); }}
8. Ackerman's Function Ackermann's Function is a recursive mathematical algorithm that can be used to test how well a system optimizes its performance of recursion. Design a function ackermann(m, n), which solves Ackermann's function. Use the following logic in your function: If m = 0 then return n + 1 If n = 0 then return ackermann(m-1,1) Otherwise, return ackermann(m-1,ackermann(m,n-1)) Once you've designed yyour function, test it by calling it with small values for m and n. Use Python.
For funX |C Solved xb Answer x+ CodeW X https://codeworko... 田) CodeWorkout X267: Recursion Programming Exercise: Cumulative Sum For function sumtok, write the missing recursive call. This function returns the sum of the values from1 to k. Examples: sumtok(5) -> 15 Your Answer: 1 public int sumtok(int k) { 2. } (0 => ) return 0; 3. } else { return > 6. { Check my answer! Reset Next exercise 1:09 AM
CodeW For fun X C Solved https://codeworkou... 臺亂 CodeWorkout X272: Recursion Programming Exercise: Is Reverse For function isReverse, write the two missing base case conditions. Given two strings, this function returns true if the two strings are identical, but are in reverse order. Otherwise it returns false. For example, if the inputs are "tac" and "cat", then the function should return true. Examples: isReverse("tac", "cat") -> true Your Answer: 1 public boolean isReverse(String s1, String s2) { 2. if > 3. 4. else if > return true; return false; 5. 6. else { String s1first = String s2last return s1first.equals (s2last) && 51. substring(0, 1); s2, substring(s2.length() 1); 7. 8. 6. isReverse(s1.substring(1), s2.substring(0, s2.length() 1)); { 12} 1:11AM 50°F Clear 12/4/2021
9. Ackermann's Function Ackermann's function is a recursive mathematical algorithm that can be used to test how well a computer performs recursion. Write a method ackermann (m, n), which solves Ackermann's function. Use the following logic in your method: If m = 0 then return n + 1 If n = 0 then return ackermann (m Otherwise, return ackermann(m 1, 1) 1, ackermann (m, n - 1))
Which is the base case of the following recursion function: def mult3(n): if n == 1: return 3 else: return mult3(n-1) + 3 else n == 1 mult3(n) return mult3(n-1) + 3
Write a recursive function that returns the nth Fibonacci number from the Fibonacciseries.int fib(int n);
Write the output of the following recursive code snippet. void exam_recursive_function (int x) If (x == 0) Return printf ("%d", x) exam_recursive_function (x-2) int main () exam_recursive_function (20) return 0 (a) 20 19 18 17 16 15 14 13 12 11 10 9 876543210 (b) 18 17 16 15 14 13 12 11 10 9 876543210 (c) 20 18 16 14 12 10 8642 (d) 2 468 10 12 14 16 18 20
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is: **** *** ** * ** *** ****
Design the following LCG random number generators by choosing the following parameters ( a, c, m, and Zo ) carefully and writing the recursive formula for each of the following: a . LCG1: has Zo = 17. b. LCG2 : has 128 > m > 16 LCG3 : has c = 7 d . LCG4: has a = 7 e. LCG5: has c not equal to 3 C.
Write a recursive function that finds n-th power of number m. Ex:m=3 n=4 Ans=81 WRITE IN PYTHON PLEASE