The following function takes two positive integers x and y as inputs, and issupposed to perform some recursive operations on x and y. Which option doyou think best describes the reason for this function not being a recursivefunction?def recursive_function3(x, y):if x < 0 and y < 0:print("This is the base case")return Falseelse:result = sum([x, y])result += 10return recursive_function3(result)Select one:There is nothing wrong with this recursive function.The base case contains a print function, but recursive function does notallow anything to be printed.This function uses only 1 parameter in the recursive call that does notmatch the function definition.

Step 1:- A recursive function is a special function that calls itself again and again.

The following function takes two positive integers x and y as inputs, and is supposed to perform some recursive operations on x and y. Which option do you think best describes the reason for this function not being a recursive function?

The following function takes two positive integers x and y as inputs, and is supposed to perform some recursive operations on x and y. Which option do you think best describes the reason for this function not being a recursive function?

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 1TF

See similar textbooks

Related questions

Q: Find the logic error(s) in the following recursive function, and explain how to correct it (them).…

A: def sum(n): if n == 0: return 0 else: return n + sum(n) Logical errors are If n ==…

Q: In the absence of a exit condition in a recursive function, the following error is given

A: Recursion works on the stack data structure. When there is no exit condition in recursive function…

Q: 6) There are other recursive functions such as the Lucas Sequence, how can you apply what you have…

A: *Your not mentioned to write a particular programming language so I will providing c++ language.…

Q: If the base case of a recursive function is never reached A. the method will call itself only once.…

A: A Recursive Function is a function which calls itself

Q: In this chapter, the rules given for calculating the factorial of a number are as follows:If n = 0…

A: Best case is the one where the function returns the value without making any recursion calls. Thus…

Q: When a recursive function is run, how much space does it take up in the memory and how much time…

A: In the given question Recursion is a technique used to solve computer problems by creating a…

Q: Write both a nonrecursive and recursive function that displays the rows of asterisks given below,…

A: 4) first lets understand the given pattern of astericks: first row i=1, has, i-1 =0 spaces followed…

Q: Define a Recursive function that will compute the factorial of N. The factorial of N is define as N!…

A: NOTE: Student did not mention any programming programming. So, I implement this recursive function…

Q: Which of the following is correct about a recursive function?

A: A function is a block of statements that can be reused by calling whenever we want

Q: For glass box testing of a recursive function, you should test cases where: a) the function returns…

A: Solution :: Let's see first that what is glass box testing? Answer :: Glass box testing is a…

Q: نقطتان )2( complete the identified statement such that the recursive function .funx(n+1) =…

A: Recursion means a function calling itself. Here in the given function, we have to fill the else…

Q: Given the function, answer the following questions: What is the depth of recursion for…

A: Task :- answer the queries for given recursive function.

Q: Write a recursive function that returns the product of the digits of its input parameter.

A: Program: // C# programusing System;// Class declarationclass ProductClass { // Function to find…

Q: What type of recursive function do you think would be more difﬁcult to debug; one that uses direct…

A: Indirect recursion is more difficult to trace and debug than direct recursion. • In direct…

Q: Why does the recursive function have to call itself to solve a smaller version of the original…

A: Why does the recursive function have to call itself? Recursion is a common mathematical and…

Q: Which of the following statements about recursion are TRUE? at least one parameter of a recursive…

A: True statements recursive function stop once the base case is reached. any problem that can be…

Q: complete the identified statement such that the recursive function funx(n+1) = n*funx(n-1), any…

A: float funx(int n) { if(n==1) return 1; else return n*funx(n-1);…

Q: Why is it required to provide a base case for every recursive function?

A: Introduction Why is it required to provide a base case for every recursive function?

Q: Write a recursive function to generate the following pattern of stars:** ** * ** * * ** * ** **Also,…

A: Note: We are using here CPP language to print the given pattern using recursive function. A…

Q: complete the identified statement such that the recursive function funx(n+1) = n*funx(n-1), any…

A: Define header file <iostream> for io operations. Define function funx with parameter n. Use if…

Q: 6) There are other recursive functions such as the Lucas Sequence, how can you apply what you have…

A: Given: The Fibonacci number sequence is in the following forms: Iterative (sequential) Recursive…

Q: describe a recursive function that cannot be rewritten as non recursive

A: Solution:-- 1)The given question is required for the solution which is to be provided in the form…

Q: Write both a nonrecursive and recursive function that displays the rows of asterisks given below,…

A: As recursive and non-recursive are separate questions, we are providing only the first answer As per…

Q: Write a recursive function that find the sum of the following series. 1+ 1/2 + 1/4 + 1/8 + ... +…

A: #include <stdio.h> #include<math.h> // Function to return sum of 1/1 + 1/4 + 1/8 + ..+…

Q: Identify the recursive functions from the given code and give reasons why these functions are…

A: A Recursive function is a function which is calling itself

Q: Write a code to find a factorial of a 5 using a recursive function.

A: Since the programming language is not mentioned in the question, we will answer this question in the…

Q: Fill-in-the-Blank __________ recursion is when a function explicitly calls itself.

A: Given: Fill-in-the-Blank __________ recursion is when a function explicitly calls itself.

Q: dentify the base case in this recursive function. Assume i>0 when the function is invoked. (Line…

A: Given: We are given a code snippet in which it is performing the addition of numbers. Goal: We have…

Q: 2. Write a recursive function printNum()that prints any given number by putting spaces between…

A: I give the code in C along with output and code screenshot

Q: 6. Consider the following recursive function. int Fun ( int n ) if ( n == 4) return 2 else return 2…

A: Fun(4) = 2 ........ (1) Fun(2) = 2 * Fun(3) ..........(2) Fun(3) = 2 * Fun(4) .............(3)…

Q: Write a recursive Python function that calculates the values of the following series

A: if number is 0 or 1, we should return 1 else we should return sum of previous two elements

Q: Write a recursive function body to find the nth term of Fibonacci Series. [Write only recursive…

A: In this question, the coding language is not specified then we are doing this question in the C…

Q: Mark the following statements as true or false. a. The general case stops the recursion. b. In the…

A: There are 3 statements given, a. The general case stops the recursion. b. In the general case, the…

Q: What should the parameter inside the recursive function in LINE 11 contain so that when user enters…

A: In Step 2, I have provided CORRECT OPTION with brief explanation---------- In further steps ,…

Q: Define a Recursive function that will compute the factorial of N. The factorial of N is define as…

A: Step-1: Start Step-2: Declare variables N and fact Step-3: Take input from user and store in N…

Q: Consider the following code for a recursive function named rf. You’ve been tasked with understanding…

Q: 1. Identify the base case in the mylen recursive function below then convert the function into an…

A: Base case is the case where recursion stop and it is also independent. Like in mylen function base…

Q: Write recursive function that returns the value of the following recursive definition: • f(x) = 0 if…

A: Function’s Code Screenshots:

Q: Indirect recursion is when function A calls function B, which in turn calls function A. is it…

A: Given: Indirect recursion is when function A calls function B, which in turn calls function A.…

Q: 5-digit positive integer is entered through the keyboard, write a function to find reverse of the…

A: Note: Here you didn't mention any programming language so we are using the C++ Programming Language…

Q: a) State the two common programming errors that cause a recursive function to call itself endlessly.

A: Recursive function: One very common programming technique, and one you will see in the wilds, is…

Q: Write a recursive function named sumSquares that returns the sum of the squares of the numbers from…

A: code: #include<iostream> #include<cstdlib> using namespace std; //function definition…

Q: Write a recursive function PrintPattern1 to print pattern that takes two integer arguments n and k.…

A: ALGORITHM:- 1. Use recursion to print the desired pattern. 2. Use base case when value of n becomes…

Concept explainers

Computational Systems

The computation systems can be defined as the systems that are capable of solving a problem that includes calculations either mathematical or logical, and are able to produce the result as an output. For example, a simple calculator that is given a set of numbers and operators as input and produces the result as an output can be defined as a computational system. The above example is a simple illustration only, the computational systems range from simple devices to complex devices such as the systems that control the SpaceX companies, Starlink satellites which are being quite recently seen in the skies at many places globally.

Question

The following function takes two positive integers x and y as inputs, and is
supposed to perform some recursive operations on x and y. Which option do
you think best describes the reason for this function not being a recursive
function?
def recursive_function3(x, y):
if x < 0 and y < 0:
print("This is the base case")
return False
else:
result = sum([x, y])
result += 10
return recursive_function3(result)
Select one:
There is nothing wrong with this recursive function.
The base case contains a print function, but recursive function does not
allow anything to be printed.
This function uses only 1 parameter in the recursive call that does not
match the function definition.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Step 5

Step 6

Trending now

This is a popular solution!

Step by step

Solved in 6 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
The following recursive function takes three positive integer arguments: def compute(n,x,y) : if n==0 : return x return compute(n-1,x+y,y) What is the value returned by the compute function? n*x+y x+y x+n*y x What if: will the returned value be for the compute function defined in the question above if the argument n is negative? x x-n*y x+n*y The function will never return a value.
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:********************Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For example, specifying 4 as the number of lines generates the above pattern.
Please can be handwritten. Question 2: Implementing a Recursive Function . Write recursive function, recursionprob(n), which takes a positive number as its argument and returns the output as shown below. The solution should clearly write the steps as shown in an example in slide number 59 and slide number 60 in lecture slides. After writing the steps, trace the function for “recursiveprob(5)” as shown in an example slide number 61. Function Output: >> recursionprob(1) 1 >> recursionprob(2) 1 4 >> recursionprob(3) 1 4 9 >>recrusionprob(4) 1 4 9 16
Given two integers x snf y, the following recurrsive definition determined the greatest common divisor of x and y, Write gcd(xy). Write a recursive function, gcd, that takes two integers as parameters and returns the greatest commmon divisorof numbers.Also write a program to test your function. Write a recursive function,reverseDigits, that takes an integer as a parameter snd returns the number with the digits reversed. Also write a program to test your application.
What type of recursion is used in the following function? int f(int n){ if (n==1) return 1; else return n+f(n-1); } Tail recursion Multiple recursion Indirect recursion Non-tail recursion
Write a recursive function that returns true if the digits of a positive integer are in increasing order; otherwise, the function returns false. Also, write a program to test your function.
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, the pattern generated is as follows: **** *** ** * * ** *** **** Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For example, specifying 4 as the number of lines generates the preceding pattern.
Each of the following recursive function definitions contains an error. Briefly but fully and clearly explain what is wrong with each definition. f(x) = 3*f(x-5) where x is a positive integer. f(0) = 7 2. g(x) = 2 - 4*g(x) where x is a positive integer. g(1) = 3 g(2) = 4
In this lab, we will practice: Implementing recursive function printing in a recursive function (before and after the recursion function call) working on setting the base and general cases for the recursion function Instructions Write a recursive function called print_num_pattern() to output the following number pattern. Given two positive integers as input (Ex: 12 3), subtract the second integer (3) from the first one (12) and print the result continually until 0 or a negative value is reached. Then continually print the result of the addition of the second integer to the last value you reached from the subtraction (zero or negative) until the first integer is reached again. Note: For this lab, 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 Hint You do not need to actually do addition. You can write statements i.e. printing statements after the recursion function call.