Consider the following code for a recursive function named rf. You've been tasked with understanding why this recursive function causes an error. You haven't been told what it does, but know it causes a fault when you run rf (2). Draw out the recursive calls for rf (2) for a few steps to the best of your ability (like we've seen with Factorial and Fibonacci). What specific problem does this recursive call rf (2) have? Make sure your answer to this question includes: the drawn out function calls showing your work and a specific explanation of the problem this function has. int rf (int number) { if (number == 1) return 1; else return rf( rf (number-1) rf (number-1)); }

Consider the following code for a recursive function named rf. You've been tasked with understanding why this recursive function causes an error. You haven't been told what it does, but know it causes a fault when you run rf (2). Draw out the recursive calls for rf (2) for a few steps to the best of your ability (like we've seen with Factorial and Fibonacci). What specific problem does this recursive call rf (2) have? Make sure your answer to this question includes: the drawn out function calls showing your work and a specific explanation of the problem this function has. int rf (int number) { if (number == 1) return 1; else return rf( rf (number-1) rf (number-1)); }

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 recursive void function that has one parameter that is a positive integer. When called, the function writes its argument to the screen backward. That is,, if the argument is 1234, it outputs the following to the screen: 4321. I've literally tried to create this program and I have no idea how to make it work. Please help me. Is it possible to explain line by line what the code does?
Consider the following code for a recursive function namedrf. You’ve been tasked with understanding why this recursive functioncauses an error. You haven’t been told what it does, but it seems to causea fault when you run rf(2). Draw out the recursive calls for rf(2) for afew steps to the best of your ability (like we’ve seen with factorial andFibonacci). What specific problem does this recursive call rf(2) have? i n t r f ( i n t number ){i f ( number == 1 ) r e t u r n 1 ;e l s e r e t u r n r f ( r f ( number − 1 ) − r f ( number − 1 ) ) ;}
Write a recursive function that returns a value of 1 if its string argument is apalindrome and zero otherwise.* Note that for the function parameters, you need to accommodate for the shrinkingstring, so that the string shrinks both from beginning and end after each recursive call.** Think about the simple cases or base cases. The 2 base cases have conditions thatwould return 0 and return 1 independently.For the palindrome, create a driver program. First ask the user to enter anystring through the keyboard. Then remove all the spaces and punctuations from thestring. Also, remove any letter capitalization from the string. Finally, pass the string tothe palindrome function through a function call.
Suppose that you have the following recursive function written in C++. I've intentionally written the function so that it doesn't use descriptive names for anything, though that's obviously not a good design practice, but I aim not to bias your understanding of the techniques you'll be using by assuming anything about what the function's goal is; to stay "on task" here, you should resist the temptation to try to figure that out first. void kaboom( const std::vector& v, std::vector& w, unsigned int i) { if (i < w.size()) { int q = 0; for (int j : v) { q += j; } w.at(i) - kaboom(v, w, i + 1); } = q; } 1. Using the techniques from our discussion of the Asymptotic Analysis of Recursion, write a recurrence that describes the time required to run the following call to kaboom for two vector v and w whose sizes are the same. Use the variable s in your recurrence to denote that size. kaboom(v, w, 0) 2. Using the repeated substitution technique, reduce the recurrence to a closed form, then give…
Write a recursive function, reverseDigits, that takes an integer as a parameter and returns the number with the digits reversed. Also, write a program to test your function.
In this question you’ll write six related recursive functions to do basic arithmetic. You’re given a starter filele, which is where you’ll write your functions, and also a test script that can check if your functions arecorrectly implemented. Every function you design must be recursive, and must follow the constraintsoutlined below.(Think of this exercise as a bunch of recursion exercises, and about what arithmetic means, which you solveby using only a restricted set of tools. No one is suggesting this results in practical software; but practicewith recursion is good. On the planet Moosetopia, the Moosetopian computer engineers have invented computers, but comparedto our computers they are very limited. Whereas we have computers that can do arithmetic, like addition,and multiplication in hardware, Moosetopian computers can not do such advanced arithmetic in hardware:they had to write a library to implement arithmetic.We’re going to simulate Moosetopian computers using simple Python…
Write a recursive function myfactorial (n) for computing the factorial of a non-negative integer. (Hint: think about adapting the examples myfunction and anotherfunction in Chapter 1.) If an input other than a non-negative integer is entered into your function myfactorial, the process will never halt. Create a new function safefactorial which behaves identically to myfactorial on non-negative integers, but raises a ValueError when other values are entered. Use safefactorial to write a function mybinom (n,r) that re- turns the binomial coefficient ("). Use mybinom (n,r) to write a function hockeystick (n,r) that n H(n,r) = [ (c.). i=r computes H(n,r)
For this exercise, you will create several recursive functions in order to get a better understanding of how recursion works. In exercise 2, we will illustrate using recursion for creating art. Create a new project in IntelliJ called Recursion. Add a new Java class called Recursion with a public static main function. You will add several functions to your Recursion class as follows: 1 Write a recursive function int sum(int n) that adds up the numbers from n to 1 and print your result. For example from main do the following: Recursion recursion = new Recursion();System.out.println(recursion.sum(6)); 1.2 Write a recursive function factorial(int n) that calculates the factorial of n. Print out the results. Add your function to your Recursion class. 1.3. Write a recursive function powerOf10(int n) that calculates 10n. 1.4. Write a more general recursive function powerOfN(int x, int p) that calculates the power of xp. Do not use the Math.pow function. 1.5.…
Write a recursive function that takes a positive integer and returns the factorial of that integer. Attention, the function must be recursive, and its name must be "fatorial".
Embed the function in a program and test it. After you have fully debugged this function, define another function named reverseCstring that takes a single argument that is a C string and modifies the argument so that it is reversed. This function will include a call to the recursive definition you did for the first part of this project, and need not be recursive. Embed this second function in a program and test it. Turn in only this final result (with output, of course).
Write a function decimal_to_binary(decimal_number) that takes in a non-negative integer and returns it in binary as an integer representation. Solve this problem using recursion. Use a helper function (with extra parameters) to handle the recursion.
Write a recursive function, sumDigits, that takes an integer as a parameter and returns the sum of the digits of the integer. Also, write a program to test your function.