Write and test a recursive function called sum_of_digits(number) that takes a positive number as input and returns the sum of all digits in that number. Sample run: >>> print(sum_of_digits(3)) >> print(sum_of_digits(30))

Write and test a recursive function called sum_of_digits(number) that takes a positive number as input and returns the sum of all digits in that number. Sample run: >>> print(sum_of_digits(3)) >> print(sum_of_digits(30))

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

Related questions

Q: Write a function that will calculate the sum of all the numbers multiple of 3 from N down to 1 using…

A: #include <stdio.h> int computeTotal(int n);int sum =0; int main() { int num; scanf("%d",…

Q: What type of recursion is used in the following function? int f(int n){ if (n==1) return 1; else…

Q: Write a recursive function definition for the following function: int squares(int n);…

A: The algorithm for the function would be Function squares (int n) Start if(n<=1) return 1, go to…

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: through the keyboard, write a function to calculate multiplication of digits of the 5-didit number…

A: given - A 5-digit positive integer is entered through the keyboard, write a function to calculate…

Q: Write a recursive function that computes the product of the digits in an integer. Use the following…

A: Repeated function call is known as recursion. Basically in recursion a function call itself again…

Q: Write a recursive function called digit_count() that takes a positive integer as a parameter and…

A: def digit_count(n): if n < 10: return 1 else: return…

Q: : Exponential Series is a series which is used to find the value of e. The formula us express the…

A: Given an exponential series which is used to calculate the value of ex. We need to write a C program…

Q: Write a recursive function F(n) that generalizes the following function:

A: Required:

Q: Write a function that will calculate the sum of all the numbers multiple of 3 from 1 to n using…

A: The program is written in C language. Please find the source code and code comments in the following…

Q: Write a recursive function that finds n-th power of number m. Ex:m=3 n=4 Ans=81 WRITE IN PYTHON…

A: #creating function def power(m,n): #check if n is 0 if yes return 1 if n==0: return…

Q: A 5-digit positive integer is entered through the keyboard, write a function to calculate…

A: EXPLANATION - Take input from user in variable named with num . Call function named with func and…

Q: Write a recursive function called that takes a string of single names separated by spaces and prints…

A: Note : As the language is not given, the below code is in python language. for(int i=0;…

Q: Write a program using a user defined recursive function to implement the following code segment.…

A: Write a program using a user defined recursive function to implement the following code…

Q: Write a recursive function that takes as a parameter a nonnegative integer and generates the…

A: Programming language is missing in the question. So we will answer this program in C language. If…

Q: Write a recursive function called print_num_pattern() to output the following number pattern. Given…

A: Here is the python code: num1 = 12num2 = 3def print_num_pattern(num1,num2): if (num1 == 0 or…

Q: Write a recursive function that parses a binary number as a string into a decimal integer. The…

A: Here is the Python Code: def binaryToDecimalHelper(binaryString, val): if len(binaryString)==0:…

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: Write a recursive C++ function that inputs a nonnegative integer n and returns the nth Fibonacci…

A: Please find the answer below :

Q: Write a recursive function diff which takes two positive integer arguments (x and y) and returns |x…

A: Hey there, I am writing the required solution of the above stated question.Please do find the…

Q: In math you can implement recursive functions like square root or power Given mul is an instruction…

A: A recursive function is a function that calls itself during its execution. The process may repeat…

Q: Write a c++ recursive function that takes two integers n and k, and prints all binary strings that…

A: Introduction: Here we are required to write a C++ function that take two integers n and k, and it…

Q: Calling a recursive function. Write a statement that calls the recursive function…

A: Python Program: # function backwards_alphabet()def backwards_alphabet(curr_letter): # ending…

Q: Write a C++ recursive function int fib(int n) that returns the value of the n’th Fibonacci number .…

A: Fibonacci number in C++

Q: Write a recursive function to see if the first letter matches the last letter, return the middle…

A: def firstCharacter(str): return str[:1] # Returns the last character of a string strdef…

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 finds the number of occurrences of a specified letter in a string…

A: GIVEN: Write a python program with recursive function def count(s, a) that finds the number of…

Q: Write a recursive function, vowels, that returns the number of vowels in a string. Also, write a…

A: Program code: //include the required header files #include<iostream> #include<string>…

Q: Define a recursive function that will return the sum of the squares of each integer from N down to…

A: I have written the code in step 2 as well as I have uploaded the image of the program with its…

Q: Recursive Copy Function Given a string str and number n, write a program that recursively appends…

A: Recursion is the process which comes into existence when a function calls a copy of itself to work…

Q: Write an iterative and recursive function that returns the sum of all the integers from O to a given…

A: def sum_till_n_rec(num): # if num reached 0 if num == 0: return 0 # otherwise return num +…

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: 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: For function sumtok, write the missing recursive call. This function returns the sum of the values…

A: Correct Code:- public int sumtok(int k) { if (k<= 0){ return 0; }else{ return k +…

Q: Write the output of the following recursive code snippet. void exam_recursive_function (int x) If (x…

A: Here we have a recursive function with the base or terminating condition that is, when x is 0 then…

Q: Write a program that uses a recursive function to convert a number in decimal to base 8 or base 16.

A: Program code: //include the header files #include <iostream> //namespace std using namespace…

Q: 4. Write a recursive function, sumofSqr, that that will return the sum of the squares of the first N…

A: For part a) I didn't have used any inbuilt function as it can be done logically. I have implemented…

Q: Write a recursive function that parses a hex number as a string into a decimal integer. The function…

A: Code to Copy:- import mathhexString=input("Enter the hexadecimal string:")#conversiondef…

Q: Write a recursive function which implements the following mathematical recurrence: f(0) = 2 f(1) = 3…

A: Refer to step 2 for the answer.

Q: 5. Given an integer n, you need to find the digital root of that integer using a recursive function.…

A: Task : The task is to define the recursive function digital_root(n). The function returns the sum…

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: 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 that checks see if the first letter matches the last letter, return the…

A: write a recursive function that checks see if the first letter matches the last letter, return the…

Q: Write a recursive function that takes as a parameter a nonnegative integer and generates the…

A: Given To know about the pattern making concept by recursion.

Q: Write a recursive function to compute the following series: m(i) = 1/3 + 2/ 5 + 3/7 + 4/ 9 + 5/11…

A: Given: Write a recursive function to compute the following series: m(i) = 1/3 + 2/ 5 + 3/7 + 4/ 9…

Concept explainers

Declaring and Defining the function

A set of statements, which performs a particular task is called a function. The program gains modularity by using function. The application is quite easy to understand, read, and edit when they are created with functions. The developer/programmer creates a function and uses main() to call the function. Once the function gets executed, the control is transferred to the main program.

Question

100%

Problem 1 (Sum of Digits)
Write and test a recursive function called sum_of_digits(number) that takes a
positive number as input and returns the sum of all digits in that number.
Sample run:
>>> print(sum_of_digits(3))
3
>>> print(sum_of_digits(30))
3
Page 1 of 4
>>> print(sum_of_digits(24))
6
>>> print(sum_of_digits(2471))
14

Expert Solution

This question has been solved!

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

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 2 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

4. Design a recursive function that accepts an integer argument, n, and prints every second number from n down to a minimum of 0. Assume that n is always a positive integer.
Please write the answer readable write the Explicit and Recursive function for the sequence(plz use f and f(x)) -7, 1, 13, 29, 49
2 a) Describe the costs and benefits of defining and using a recursive function.
Create a recursive function that multiplies two positive integers without the need of the * (or /) operator. You can utilise addition, subtraction, and bit shifting, but you should keep the amount of operations to a minimum.
in c++ The Fibonacci number is the one in which each number is the sum of the two precedingnumbers. An example is shown below:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...Write a recursive function that prints the first fifteen Fibonacci numbers. Your functionmust be recursive. Note that the first three Fibonacci numbers are 0, 1, 1, but after that ,the Fibonacci number is n = n - 1 + n - 2. Note that you will write only a function.
Create a recursive function that simulates the range function. For example: Enter the range (begin, end, increment) separated by spaces: 3 15 3 [3,6,9,12]
Write a recursive function PrintPattern2 that receives two arguments: (i) a character ch; (ii) number of lines and print the pattern.Example:PrintPattern2('*',5) will print the following pattern
1. Bibi is challenging you to implement a recursive function to check integer X is a prime number or not. A prime number can be divided only by 1 and itself. You have to implement a recursive function “int isPrime(int x)” in C. Format Input The first line of the input contains an integer T, the number of test case. The next T line consist a positive integer X. Format Output For each test case, print Case #X: Y. X is the number of test case and Y is the result from function “isPrime(x)”. Constraints 1 <= X <= 100 2 <= X <= 1.000
c program, The greatest common divisor (GCD) of two integers (of which at least one is nonzero) is the largest positive integer that divides the numbers. Write a C function gcd that accepts two integers and returns -1 if both integers are zero, otherwise it returns their GCD. Write a C program (that includes the function gcd) which accepts two integers and prints their GCD. Do not use a recursive function
1. Write a recursive function that takes a string as an input and returns the reverse of the string. 2.Write a recursive function rec_string that produces the output shown below for the corresponding function calls. Write a main function to test the function. Method call rec_string(‘abcde’), will produce the following output: *ede cde bcde abcde Method call rec_string(‘abc’), will produce the following output: *cbc abc 3. Write a recursive function for Euclid's algorithm to find the greatest common divisor (gcd) of two positive integers. gcd is the largest integer that divides evenly into both of them. For example, the gcd(102, 68) = 34. You may recall learning about the greatest common divisor when you learned to reduce fractions. For example, we can simplify 68/102 to 2/3 by dividing both numerator and denominator by 34, their gcd. Finding the gcd of huge numbers is an important problem that arises in many commercial applications. We can efficiently compute the gcd using the…
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
Consider the following recursive C function, assume that get (6) function is being called in the main (), then how many times will the get () function be invoked before returning to the main () function? Explain the execution logic. Assume that you have a main () function, inside the main () function, call get () and pass the argument 6, get (6). void get(int n) { if(n<1) return; get(n-1); get(n-3); printf("%d", n); } pls explain with flowchart.