Consider the following code segments: 1: function Fun Rec(k) 2: if k=0 then: 3: return 0 4: 5: 6: 7: end function else: return Fun Rec(k-1) + k end if 8: 9: result = 0 10: forj=1 to n do 11: result = result + FunRec(j) 12: end for 13: Print result (a) When Fun Rec(k) is called (assume k is an integer and k > 0), how many times is the function called before the initial call is terminated? Give the answer in terms of k. (b) What does Fun Rec(k) return? Give the answer in terms of k. (c) How many times is Fun Rec called in total? Include the calls on line 11 as well as the recursive calls. Give the answer in terms of n. (d) What is final value of result in line 13? Give the answer in terms of n.

Consider the following code segments: 1: function Fun Rec(k) 2: if k=0 then: 3: return 0 4: 5: 6: 7: end function else: return Fun Rec(k-1) + k end if 8: 9: result = 0 10: forj=1 to n do 11: result = result + FunRec(j) 12: end for 13: Print result (a) When Fun Rec(k) is called (assume k is an integer and k > 0), how many times is the function called before the initial call is terminated? Give the answer in terms of k. (b) What does Fun Rec(k) return? Give the answer in terms of k. (c) How many times is Fun Rec called in total? Include the calls on line 11 as well as the recursive calls. Give the answer in terms of n. (d) What is final value of result in line 13? Give the answer in terms of n.

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 6PE

See similar textbooks

Similar questions

(Data processing) Your professor has asked you to write a C++ program that determines grades at the end of the semester. For each student, identified by an integer number between 1 and 60, four exam grades must be kept, and two final grade averages must be computed. The first grade average is simply the average of all four grades. The second grade average is computed by weighting the four grades as follows: The first grade gets a weight of 0.2, the second grade gets a weight of 0.3, the third grade gets a weight of 0.3, and the fourth grade gets a weight of 0.2. That is, the final grade is computed as follows: 0.2grade1+0.3grade2+0.3grade3+0.2grade4 Using this information, construct a 60-by-7 two-dimensional array, in which the first column is used for the student number, the next four columns for the grades, and the last two columns for the computed final grades. The program’s output should be a display of the data in the completed array. For testing purposes, the professor has provided the following data:
True or False 1-int fx(char x) is a function with int return value 2-int fx(char &x) is a function with parameter passed by value 3-void fx(char ch) is a function with no return value 4-char fx( int x) is a function with int return value
Exponent y Catherine Arellano mplement a recursive function that returns he exponent given the base and the result. for example, if the base is 2 and the result is 3, then the output should be 3 because the exponent needed for 2 to become 8 is 3 (i.e. 23 = 8) nstructions: 1. In the code editor, you are provided with a main() function that asks the user for two integer inputs: 1. The first integer is the base 2. The second integer is the result 2. Furthermore, you are provided with the getExponent() function. The details of this function are the following: 1. Return type - int 2. Name - getExponent 3. Parameters 1. int - base 2. int - result 4. Description - this recursive function returns the exponent 5. Your task is to add the base case and the general case so it will work Score: 0/5 Overview 1080 main.c exponent.h 1 #include 2 #include "exponent.h" 3 int main(void) { 4 int base, result; 5 6 printf("Enter the base: "); scanf("%d", &base); 7 8 9 printf("Enter the result: ");…
1-int fx(char &x) is a function with parameter passed by value(False/True) 2-int fx(char x) is a function with int return value(False/True) 3-void fx(char ch) is a function with no return value(False/True) 4-char fx( int x) is a function with int return value(False/True)
true false char fx( int x) is a function with int return value int fx(char &x) is a function with parameter passed by value void fx(char ch) is a function with no return value int fx(char x) is a function with int return value
Function GetHighestValue(integer value1, integer value2) returns integer result if value1 > value2 result = value1 else result = value2 Function Main() returns nothing integer userNum1 integer userNum2 integer userNum3 integer maxValue userNum1 = Get next input userNum2 = Get next input userNum3 = Get next input
Complete the function that calculates the sum of the first n+1 terms of the geometric series a, ar, ar² ar³, arª ….. arn Note that the series begins with a and the last term is ar", in total there are n+1 terms. 1: # complete the function given the #variables a,r,n and return the value as series_sum. def sum geometric_series(a,r,n): # YOUR CODE HERE return series_sum print (sum_geometric_series (4.0, 5, 10))
void fx(char ch) is a function with no return value int fx(char x) is a function with int return value int fx(char &x) is a function with parameter passed by value char fx( int x) is a function with int return value
Detect Even/Odd Write a function with no parameters, even_or_odd() in Python Specifications: read an integer from standard input return 0 if the integer is even, 1 if the integer is odd do not use a conditional ("if") statement, just use modular arithmetic (such as // or %) do not print the result, return it HINT: What is the remainder when you divide an even number by 2? What is the remainder when you divide an odd number by 2? REMINDER: DO NOT use prompts in your input statements for this problem. For example: Test Input Result ans = even_or_odd() print(ans) 5 1 ans = even_or_odd() print(ans) -14 0 ans = even_or_odd() print(ans) 0 0 ans = even_or_odd() print(ans) 99 1
Write a function in C programming language that gets two ints x and y, and returns the sum of all ints between x and y, including them. int sum_interval(int x, int y); For example: - sum_interval(1, 4)returns 1+2+3+4=10. - sum_interval(10, 3)returns 3+4+5+6+7+8+9+10=52. - sum_interval(2, -1)returns (-1)+0+1+2=2. - sum_interval(-1, -1)returns -1. Note that we may have x>=y or x<=y. You may assume that the sum will be within the range of int.
Programming Language :- C 7. A function is defined for a positive integer n as follows: 3n + 1, if n is odd f(n) = { n if n is even 2 We consider the repeated application of the function starting with a given integer n, as follows: f(n), f(f(n)), f(f(f(n))), It is conjectured that no matter which positive integer n you start from; this sequence eventually will reach to 1. If n = 13, the sequence will be 13, 40, 20, 10, 5, 16, 8, 4, 2, 1. Thus if you start from n = 13, you need to apply function 10 times to reach 1. Write a recursive function that takes n as an input number and returns how many times function f has to be applied repeatedly to reach 1.
Programming Language: Python 4. Write a Python function that takes a positive integer n as an argument and returns the largest power of two greater than or equal to n.