Answered: What output will be produced by…

What output will be produced by function call G('F', 4)? Trace the sequence of recursive calls and show complete dry run of all the recursive calls. void G(char ch, int n) { if(n<=0) cout<

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 8SA

See similar textbooks

Related questions

Q: Below is a recursive version of binarySearch: int binarySearch(int nums[], int low, int high, int…

A: Below is the code analysis for given scenario:

Q: Consider the below recursive function: public static void func (int n) { if (n == 0) return; else {…

A: Following are the full program code to the given question: public class Main//defining a class…

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

A: Required: Write a recursive function called that takes a string of single names separated by…

Q: Write a recursive Python function that matches the following docstring: ''' Function -- sum_fives…

A: Recursion is the process of calling the same function repeatedly to make the problem into smaller…

Q: checkNumber, to check if all the elements in the positions 0 ... N-1 of a list of integers (A) are…

A: Q. This is the prompt: Write a recursive Python function named checkNumber, to check if all the…

Q: Implement a recursive C++ function which takes an array of integers (arr) and the starting (start)…

A: The solution involves the use of functions, bubble sort,, arrays and loops.

Q: Below is a recursive version of binarySearch: int binarySearch(int nums[], int low, int high, int…

A: Given : Array : {2, 3, 5, 7, 8, 10}

Q: 12. Consider the recursive function int gcd( int a, int b) int gcd( int a, int b){ if (b > a)…

A: Recursive function: It is a function that calls itself during execution. The number of invocations…

Q: The following function f uses recursion: def f(n): if n 0 a <- a + i + (i-1) return a c) def…

A: Given: The following function f uses recursion:def f(n):if n <= 1return nelsereturn f(n-1) +…

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: The answer must be a Racket Code snapshot with output with the correct answer or a Downvote will be…

A: Racket code with comments : ; nlist+ takes an nlist ls as argument ; base case : if ls is empty,…

Q: Examples: Find the tight bound of the following recursive functions, T(n). T(n)=9T(n/3)+n T(n)=…

A: the solution is an given below :

Q: (a) What does dynamic programming have in common with divide-and-conquer? What is a principal…

A: Answer a) Both Dynamic programming and Divide-and-conquer solve a bigger problem using solutions to…

Q: Write a recursive function count_odds(Ist) which takes as parameter a list of numbers (Ist) and…

A: The program for the above given question is given below:

Q: Below is the recursive implementation of binary search from lab with one change (in red): the print…

A: In this program, we are performing binary search,

Q: a) Write a non-recursive function in C++/ to multiply all even numbers from 2 to n, where n is an…

A: a) //non recursive function to multiply all even numbers from 2 to n and returns resultint…

Q: Write a Python code implementing naïve LCS recursive, LCS DP, and LCS bottom-up versions. Then…

A: import time def lcs_recursive(i,j,X,Y): #If one of X,Y completed if i==-1 or j==-1: return…

Q: Give a recursive definition of the function that takes ? (?ℎ??? ? ∈ ℕ) and gives the number of…

A: Answer: For n=1, it means how many distinct Strings of length 1 are there , using only the…

Q: Consider the following recursive function: def collatz (n): if n == 1: return 0 if n % 2 == 0:…

A: Recursion is a process of calling the function itself. But, to exit from this we need a base case as…

Q: Consider the below recursive function: public static void func (int n) { if (n e) return; else {…

A: Provided the activation frames with n = 8 for given method and also shown the output printed by the…

Q: Write a recursive C++ program to find the GCD of two numbers and using this write a function to find…

A: #include <iostream>using namespace std;int hcf(int n1, int n2);int main(){int n1, n2;cout…

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

A: Answer: Given Code: void mergeSort(int a[],int p,int r) { int q; if(p<r) { q=(p=r)/2;…

Q: 12. Consider the recursive function (from class) int gcd( int a, int b) int gcd( int a, int b){ if…

A: Recursive function: A recursive function is a function that during its execution calls…

Q: Consider the recursive procedure whose skeleton is defined below. True or False, the implementation…

A: Please find the answer below :

Q: i. Write a recursive function that displays smallest value stored in BST tree? ii. What output will…

A: Binary Search Tree is a collection of nodes where each node contains left node reference, data part…

Q: Code Analysis () If we change the first line of code in the function to be “if (low >= high) return…

Q: python code Write a recursive function such that, given a list of intergers (say v) and an integer…

A: Please refer below code and output: def subset(set, n, sum): # Base Case for subset if (sum…

Q: Below is a recursive version of binarySearch: int binarySearch(int nums[], int low, int high, int…

A: the answer is given below

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

A: Explanation: Merge Sort works on the principle of divide and conquer rule. To sort a lengthy array,…

Q: def before (k, A) which takes an integer k and an array A of integers as inputs and returns a new…

A: Approach : Step 1 is to find the last index of k If index result in -1 return None else Traverse…

Q: Write a recursive version of ?add() in C or C++, then use this program to develop a MIPS program…

A: According to the question, we have to write a recursive version of add() in C or C++. After that we…

Q: Let n be a valid input, i.e., a natural number. Which of the following functions returns the same…

A: The recursion is a common mathematical and programming concept. The method of recursion implies that…

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

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

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 returns n copies ofa quilt side by side in ä row assume that you…

A: The approach is very simple. The image should be an array (matrix of pixels). If the value of n is 0…

Q: Below is a recursive version of binary search: int binarySearch(int nums[], int low, int high, int…

A: The question is related to the binary search.

Q: program is given below attachment

A: a. The returned value of fib(5) will be: 0 1 1 2 3 b. Recurrence relation for T(n): T(n - 1) + T(n -…

Q: Consider the following recursive function: int Func(int num) { if (num == 0) return 0; else return…

A: 1) yes, it needs a constraint on the values that are passed as a parameter of this function to pass…

Q: date-if" that takes two functions, f and g, and a list xs as parameters and evaluates to a list. f…

A: Step 1: Recursive Racket function "update-if" that takes two functions, f and g, and a list xs as…

Q: Implement a recursive C++ function which takes an array of integers (arr) and the starting (start)…

A: Here we need to find the second smallest element’s index in the given range using recursive…

Q: Implement a recursive C++ function which takes an integer array (A) and the starting (start) and…

A: Lets analyze what information we are given and what is expected out of it. Required : Recursive C++…

Q: Implement a recursive C++ function which takes two integers num and den as arguments and returns the…

A: Answer in step2

Q: Can someone explain how the output of this recursive function is 18? Recursion is confusing to me.…

A: The question is to find the reason: why the output of the given recursive function is 18. def R(n):…

Q: Write a recursive reverse (s) function to return a copy of the string s in reverse order. Include a…

A: The following steps need to be taken for the given program: The reverse function should accept the…

Q: Write a recursive function called make palindrome that takes a sequence as a parameter and returns a…

A: Here is the program for the given problem:

Q: write java codes to do the following: Write a recursive function to check if an integer array is…

A: public class Main{ public static boolean checkArraySym(int [ ] A, int first, int last){…

Q: Write a recursive function sum that takes a two dimensional array and returns sum of its all…

A: Program plan:- 1. Include header file. 2. Function declaration for merge sort. 3. Recursive merge…

Concept explainers

Randomized Select Algorithm

A randomized algorithm is defined as one that uses a certain amount of randomization in its logic or operation. It is said to be an algorithm that depends on the random number to perform its operation. It is used for reducing the overall time complexity, space complexity in the standard algorithm. The randomized algorithm uses the concept of random numbers to find the solutions to the different kinds of problems and also to improve the problem solutions.

Question

ii. What output will be produced by function call G('F', 4)? Trace the sequence of
recursive calls and show complete dry run of all the recursive calls.
void G(char ch, int n)
{
if(n< =0)
cout< «endl;
else
G(ch+2, n-1);
cout <<ch;

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

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

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

Consider the following function: void fun_with_recursion(int x) { printf("%i\n", x); fun_with_recursion(x + 1); } What will happen when this function is called by passing it the value 0?
Write a function which takes two integer parameters for values to be added together and returns the result by value. The function may not print anything or read anything directly from the user (i.e. no cin/cout in the function). Assume that the values passed to the function will not be negative, but could be 0 or positive, and will both be integers. The function must implement addition recursively, and cannot use the standalone + operator (only ++) or call any other functions.
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]
language: Python Problem: Write a recursive function reverse(sentence) for reversing a sentence. For example, reverse('Who let the dogs out?') will return '?tuo sgod eht tel ohW'. Also write a test case in the program to prove the function given works.
write a recursive version. The function takes two string parameters, s1 and s2 and returns the starting index of s2 inside the first string s1, or -1 if s2 is not found in s1. You must not use any loops; you also cannot use the string member functions find or rfind. You may use the member functions size, at and substr. Your function must be recursive.
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
12. Consider the recursive function int gcd( int a, int b) int gcd( int a, int b){ if (b > a) return gcd(b,a); if ( b == 0 ) return a; return gcd( b, a% b); } How many invocation (calls) of the gcd() function will be made by the call gcd(72, 30)?
‘Write a function nesting(), which takes an arbitrary number of parameters, and returns a list containing the arguments. Write another function unnesting(), which takes a list L as the parameter and retums a 1D list. Notice that, you should be able to use loops to solve thisproblem and should not use recursive functions (which we will not cover in this course). ‘Write assertions to test the two functions.For example nesting(1, nesting(2, 3, nesting(4, 5, [6])), [7, 8], 9)unnesting([1, [2, 3, [4, 5, [6]]], [7. 8], 9]) (1, [2, 3, [4, 5, [6]]], [7, 8], 9][1, 2,3, 4, 5, 6, 7, 8 9]
Write a recursive function 'void reverse(string &word)' that reverses the given input string. string name = "lexa"; reverse(name); cout << name << endl; //should display "axel". without using the following loops: -no for loops -no while loops -no do-while's -no while-do's -no for-while's -no while-for-do's
Write an iterative version of the function defined in Self-Test Exercise 2. (Write a recursive void function that has one parameter that is a positive integer and that writes out that number of asterisks (*) to the screen, all on one line.)
8. A country has coins of denomination 3, 5 and 10 respectively. Write a recursive function canchange() which returns -1 if it is not possible to pay a value of k using these coins. Otherwise, it returns the minimum number of coins needed to make the payment. For example, canchange(7) will return -1. On the other hand, canchange(14) will return 4 because 14 can be paid as 3+3+3+5 and there is no other way to pay with fewer coins Programming Language:- C
8. A country has coins of denomination 3, 5 and 10 respectively. Write a recursive function canchange() which returns -1 if it is not possible to pay a value of k using these coins. Otherwise, it returns the minimum number of coins needed to make the payment. For example, canchange(7) will return -1. On the other hand, canchange(14) will return 4 because 14 can be paid as 3+3+3+5 and there is no other way to pay with fewer coins