5.2 Define a function that compue factorial of n, where n is an integer a) The function is an iterative function b) The function is a recursive function Test both function in another function named main. 5.3 Write a script that generates the first 20 Fibonacci numbers. 5.4 Define a recursive function that print 2, 4, 6, ...50

5.2 Define a function that compue factorial of n, where n is an integer a) The function is an iterative function b) The function is a recursive function Test both function in another function named main. 5.3 Write a script that generates the first 20 Fibonacci numbers. 5.4 Define a recursive function that print 2, 4, 6, ...50

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

See similar textbooks

Similar questions

14. (7 points) Write a recursive function count_odds(Ist) which takes as parameter a list of numbers (1st) and counts the odd numbers in it. Example: >>> count_odds ([2, 5, 7, 6, 4]) 2
4.10 LAB: All permutations of names Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names, then use a recursive function to create and output all possible orderings of those names separated by a comma, one ordering per line. When the input is: Julia Lucas Mia then the output is (must match the below ordering): Julia, Lucas, Mia Julia, Mia, Lucas Lucas, Julia, Mia Lucas, Mia, Julia Mia, Julia, Lucas Mia, Lucas, Julia def print_all_permutations(permList, nameList): # TODO: Implement method to create and output all permutations of the list of names. if __name__ == "__main__": nameList = input().split(' ') permList = [] print_all_permutations(permList, nameList)
T/F 9) Since iterative solutions often use loop variables and recursive solutions do not, the recursive solution is usuallymore memory efficient (uses less memory) than the equivalent iterative solution
8 T OR F The base case does not exist or is not reached, when there is infinite recursion.
3.6 LAB: Number pattern Write a recursive function called print_num_pattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. For coding simplicity, output a space after every integer, including the last. Do not end output with a newline Ex. If the input is: 12 3 the output is 12 9 6 3 0 3 6 9 12 0/10 LAB ACTIVITY 3.6.1: LAB: Number pattern main.py Load default template 1. TODO: Write recursive print_num_pattern() function 2 3 if name "main": 4 numi int(input()) 5 num2 int(input()) print_num_pattern(num, num2)
3.6 LAB: Number pattern Write a recursive function called print_num_pattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. For coding simplicity, output a space after every integer, including the last. Do not end output with a newline. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12
Python Q1) Write a function get_new_grades, such that given a list of grades as an input parameter,returns a new list where the minimum score isreplaced by 50.Do not modify the initial list! Q2) Write a function compute_stats, such that given a list of grades as an input parameter,it calls the function get_new_grades (defined in the previous questions)and returns a list that contains the average value of the initial list andthe average value of the list from the get_new_grades function.
Reversing an Array1. Describe the definition of recursive function.oBase case(s)oRecursive case(s)2. Write the code.
Question 4: (Find the minimum value in an array) Write a program that include a recursive function "recursiveMinimnm" that takes an integer array and the array size as arguments and returns the smallest element of the array. The function should stop processing and return when it receives an array of one element. Answer (2.5)
Python question Question 19 (Algorithmic problem) Write a RECURSIVE function that, given a text (as a string), returns the same text with vowels replaced with a hyphen (-). See the examples given below (doctests) Note: No marks will be awarded for non-recursive implementations. def remove_vowels(text): """ Input: a string of text Output: the same text with vowels removed Examples: >>> remove_vowels('this text') 'th-s t-xt' >>> remove_vowels('Python') 'Pyth-n' >>> remove_vowels('') '' >>> remove_vowels('Apple') '-ppl-' >>> remove_vowels('myths') 'myths' """
T/F 7) The recursive method to solve the Towers of Hanoi is usable only if the parameter for the number of disks is 7 orsmaller.
19-8) isMember Function Write a recursive Boolean function named isMember. The function should accept three arguments: an int array, an int index number holding the size of the array and an int value to be searched for. The function should return true if the value is found in the array, or false if the value is not found in the array. Demonstrate the function in a driver program. --ORIGINAL QUESTION (Had no index variable and no type on the array)- 19-6) Recursive Power Function Write a function that uses recursion to raise a number to a power. The function should accept two arguments: the number to be raised and the exponent. Assume that the exponent is a nonnegative integer. Demonstrate the function in a program. SAMPLE RUN #0: ./rBoolSearch |Interactive Session Hide Invisibles Highlight: None Show Highlighted Only valueT=-15.has · been - found -in-arr which-is- correct.e valueF=-98. has not- been found - which is.correct. valueT=-147.has been found-in-arr which-is.correct.…