Consider the following recursive function:void recEx11(int x){if (x > 0)if (x % 2 == 0){recEx11((x - 3) / 2);cout << x << " ";}else{recEx11((x - 4) / 2);cout << x << " ";}}What is the output of the following statements? a. recEx11(28); b. recEx11(148); c. recEx11(98); d. recEx11(-30)

Consider the following recursive function:void recEx11(int x){if (x > 0)if (x % 2 == 0){recEx11((x - 3) / 2);cout << x << " ";}else{recEx11((x - 4) / 2);cout << x << " ";}}What is the output of the following statements? a. recEx11(28); b. recEx11(148); c. recEx11(98); d. recEx11(-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 7SA

See similar textbooks

Related questions

Q: Write a program that computes the Greatest Common Factor for any given two values. The user should…

A: #include <iostream> using namespace std; int GCF(int n, int m){ if(m<=n &&…

Q: The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13,…

A: #include <iostream>using namespace std;int fibSeries(int n) { if((n==1)||(n==0)) {…

Q: We rite a recursive function that calculates the products of natural numbers (1 through n) as…

A: The steps to writing the recursive function are shown below. Consider a recursive function as…

Q: Write a recursive function that determines whether an array a palindrome, where the array and its…

A: Algorithm: Start Read array size n Read n characters in an array ch Implement palindrome() function…

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

Q: Write a function that takes one integer parameter, makes sure it is an integer, prints sum of every…

A: function sum(int number, int temp) Start if temp < 1 then return 1 else then display number "+"…

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

A: Here the recursion is happened at the tail end of the conditional clause.

Q: Write a recursive function called draw_triangle() that outputs lines of '*' to form a right side up…

A: Coded in Python 3.

Q: Consider the following recursive function:void recFun(int u){if (u == 0)cout << "Zero!…

A: program code: //header files #include <iostream> using namespace std; //function void…

Q: Write a program that recursively and iteratively counts down from n. a) Create a void recursive…

A: Since the programming language is not mentioned, we'll do it in c++ a) The programming methodology…

Q: Given this recursive function: unsigned long secret(unsigned long x, unsigned long y) { if(y < 0)…

A: This question is from the c++ programming language. Here a secret() function is given that is taking…

Q: void recurse(int num) { if (num == 0) cout << “ Zero” << endl; else { cout << " " <<…

A: NOTE: - The call being made to recurse(num +1) in else statement is missing the semi-colon. if…

Q: Given two integers x snf y, the following recurrsive definition determined the greatest common…

A: Note-since programming language is not specified so we are providing solution in python programming…

Q: Write a recursive function (compute1(n) ) that takes one parameter and implements the following…

A: Compute.h file: #ifndef mainH #define mainH int compute1(int n); #endif Screenshot:

Q: Write a program called Super_Digit.java with a recursive function called superDigit. The function…

A: CODE: import java.util.Scanner; public class Super_digit { public static int…

Q: Create a recursive function that simulates the range function. For example: Enter the range…

A: The code is given below.

Q: 6. Write a recursive function to evaluate f(x) = x- - 20 + 3! 5! 7! + ⠀

A: code snippet:

Q: Q2) Given the following function int f (int x, int y, int z){ int p = z, a =0; while (xl=0){ if (x…

A: 2) A) The function, f(x, y, z) is used to calculate and return the value of p which based is based…

Q: Write a recursive function that returns the sum of the digits of an integer. int sumOfDigits(int x);

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

Q: Implement a function that recursively calculates the nth number in the Fibonacci sequence of…

A: Hi there, Please find your solution below, I hope you would find my solution useful and helpful.…

Q: Consider the following recursive function: { a if b = 0, %3D f(b, a) 1 f(6, 2. (a f(a, b) if b > a >…

A: Answer is given below .

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: We define the following recursive Python function: def cool(n): if n==0: return 2 if n==1: return 1…

A: Given To do the python program using dynamic programming. def cool(n): if n==0: return 2…

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

A: Please find the answer below :

Q: Consider the following recursive function: void exercise(int x){ if (x >0 8& x < 10){ cout <<x <<"".…

A: The solution to the given problem is below.

Q: 4. CodeW. X b For fun X Solved x b Answer x+ Ohttps://codeworko... CodeWorkout X264: Recursion…

A: Actually, python is a easiest programming language. It is a dynamically typed programming language.…

Q: Python code In Python implement a recursive function named test() that accepts an integer…

A: Here is the python3 code implementation of above code. Note: I have provided screenshot of code.…

Q: Write a recursive function that determines whether an array is a palindrome, where the array and its…

A: Given: Write a recursive code to check whether array is palindrome or not.

Q: Explain the functionality of below recursive functions. static void fun1(int n) { int i = 0; if…

A: Recursion : => Recursion happens when something is described in terms of itself or of its type.…

Q: Write a program that asks a number “N” from user. Write a function that takes this number “N”, then…

A: Introduction of Program: The C program takes the value of N from the user and then the program…

Q: Consider the following recursive function: void recurse(int num) { if (num == 0) cout <<…

A: Conditions for the recursive function: Every recursive function must have a valid terminating base…

Q: Write a recursive function int fib (int n) to compute the Fibonacci numbers where n is a positive…

A: code snippet:

Q: Python Write a recursive function that accepts an integer argument, n. The function should display n…

A: It is defined as a powerful general-purpose programming language. It is used in web development,…

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

A: 1. declare a function called PrintNumPattern with parameter num1 and num2 and one optional parameter…

Q: IVE function, without using any loops, that prints the contents of a matrix with 3 columns. The…

A: the code is an given below : Below is the recursive function :…

Q: In C++ Consider the following recursive function (Chapter 17, #9, modified) void recFun(int x)…

A: Given: In C++ Consider the following recursive function (Chapter 17, #9, modified) How can the…

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: Implement a recursive C++ function which takes a character (ch) and a positive integer (n) and…

A: #include<bits/stdc++.h> using namespace std; //the print function void printNTimes(char ch,…

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 recursive function that displays an integer value reversely on the console using the…

A: Here is the python code: rev_num = 0base_pos = 1 def reverseDisplay(value): global rev_num…

Q: Write a recursive function called poweroftwo that returns the k" power of 2. As an example, the call…

A: Given:

Q: Consider the following recursive function: void recurse(int num) { if (num == 0)…

A: EXPLANATION: “Yes”, the given call recurse (-2) us a valid call. This calls the recurse function…

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: Write a recursive function to compute the following series: m(i) = 1 + 1/2 + 1/3 + . . . + 1/i Write…

A: PROGRAM CODE: public class Main { /** Main method */ public static void main(String[] args) {…

Q: void method(int z) { if (z > 0 && z < 10) { cout << z << " "; method(z + 1); } } What is the output…

A: 2. Consider the following recursive function: void method(int z) { if (z > 0 && z <…

Q: In program C Write a recursive function find_sum(n)that calculates the sum of successive integers…

A: int find_sum(int n) { if(n == 1) return 1; else return (n + find_sum(n-1));}

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.

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

Consider the following recursive function:
void recEx11(int x)
{
if (x > 0)
if (x % 2 == 0)
{
recEx11((x - 3) / 2);
cout << x << " ";
}
else
{
recEx11((x - 4) / 2);
cout << x << " ";
}
}
What is the output of the following statements?
a. recEx11(28); b. recEx11(148); c. recEx11(98); d. recEx11(-30)

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

Trending now

This is a popular solution!

Step by step

Solved in 4 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

In C++ Consider the following recursive function (Chapter 17, #9, modified) void recFun(int x) { if (x > 10) { recFun(x / 10); cout<< x % 10; } else cout<< x; } How can the code be modified so that the sum of all digits is printed?
Write a recursive function diff which takes two positive integer arguments (x and y) and returns |x – y|. You may not perform an x - y calculation anywhere in the function! Example calls: diff(3, 7) returns 4; diff(7,3) returns 4 In JAVA
Java C++ Write a recursive function that accepts two arguments into the parameters x and y. The function should return the value of x times y. Remember, multiplication can be performed as repeated addition: 7∗4=4+4+4+4+4+4+47 * 4=4+4+4+4+4+4+47∗4=4+4+4+4+4+4+4
In C programing Write a recursive function that returns the product of the digits of its integer input parameter, n. You may assume that n is non-negative. For example, productDigits(243) should return 24, since 2 x 4 x 3 = 24.int productDigits (int n) {
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
Write a recursive function definition for the following function: int squares(int n); //Precondition: n >= 1 //Returns the sum of the squares of numbers 1 through n. For example, squares(3) returns 14 because 12 + 22 + 32 is 14.
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.
For function decToBinary, write the missing parts of the recursion case. This function should return a string that stores the binary equivalent for int variable num. Example: The binary equivalent of 13 may be found by repeatedly dividing 13 by 2. So, 13 in base 2 is represented by the string "1101". Examples: decToBinary(13) -> "1101" public String decToBinary (int num) { if (num < 2) return Integer.toString(num); else return <<Missing recursive call>> + <<Missing calculation>>;}
(C Language) Write a recursive function called PrintNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until a negative value is reached, and then continually add the second integer until the first integer is again reached. For this lab, do not end output with a newline.
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.
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.
(C Language) Write a recursive function called DigitCount() that takes a non-negative integer as a parameter and returns the number of digits in the integer. Hint: The digit count increases by 1 whenever the input number is divided by 10.