[a] Prove by strong induction that any postage ≥ 18 can be formed using only 4-cent and 7-cent stamps. (Hint: consider bases cases for 18 thru 21.) [b] Write a Java/Python-like pseudocode for a function that determines the number of each denomination of stamp for a postage amount ≥ 18. (It need not be con

[a] Prove by strong induction that any postage ≥ 18 can be formed using only 4-cent and 7-cent stamps. (Hint: consider bases cases for 18 thru 21.) [b] Write a Java/Python-like pseudocode for a function that determines the number of each denomination of stamp for a postage amount ≥ 18. (It need not be con

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

Similar questions

Python only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…
Python only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…
a) Write down a tail recursive implementation of the function sum in python language or programming language of your choice. You may use the helper function in your solution. b) Write down a tail recursive implementation of the function factorial in pythonlanguage or programming language of your choice. You may use the helper function in yoursolution.
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
2. Write a recursive function printNum()that prints any given number by putting spaces between successive characters to be printed. For example: printNum (12) prints 1 2 printNum (327) prints 3 2 7 printNum (-912) prints - 912 Programming Language :- C
Python program (recursive function) A recursive function is a function defined in terms of itself via self-referential expressions. This means that the function will continue to call itself and repeat its behavior until some condition is met to return a result. Write a python recursive functionprod that takes x as an argument, and returns the result where, result=1*1/2*1/3*….*1/n Include a screenshot that shows a python program that uses the above function and prints the rounded result to three decimal placesafter prompting the user to enter a number, x. Use x=3. N.B: The code should be included please.
2) Consider a recursive function to find the maximum value in an array of integers. The function declaration is: int maxValue( int vals[], int size, int start ); For this function, we need to know the size of the array and the starting index of the array (because both will change when a recursive call is made). You may assume that there is at least one value in the array. C++ language
Midterm Practice Problems 1. Use recursion to write a function count_ones that returns how many Is there are in a number n when represented in decimal (base 10). For example, 1231 has two 1s. You can assume that n is nonnegative and at most 9 digits long. Do not use global (or static) variables. In main perform at least three tests of count_ones and use assert to check that the returned value is correct. Your function should have the following prototype: // count_ones (n) returns the number of is in the decimal representation of n // requires: 0 <= n < 10^9 int count_ones (int n);
C Program: An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to the number. For example, 6 is a perfect number because 6 = 1 + 2 + 3. I have written a function called isPerfect (see below), that determines whether parameter passed to the function is a perfect number. Use this function in a C program that determines and prints all the perfect numbers between 1 and 1000. Print the factors of each perfect number to confirm that the number is indeed perfect. // isPerfect returns true if value is perfect integer, // i.e., if value is equal to sum of its factors int isPerfect(int value) { int factorSum = 1; // current sum of factors // loop through possible factor values for (int i = 2; i <= value / 2; ++i) { // if i is factor if (value % i == 0) { factorSum += i; // add to sum } } // return true if value is equal to sum of factors if (factorSum == value) { return…
Please use easy logic with proper indentations and comments for understanding!. Coding should be in C++. 1. Write a recursive function named printStars which receives an int parameter. If the parameter is positive, the function prints the given number of asterisks; otherwise the function does nothing. The function does not return a value. Thus, if the printStars(8) is called, ******** (8 asterisks) will be printed. The function must not use a loop of any kind to accomplish its job. Instead, it gets the job done by (recursively) calling itself.
1. Below, enter code to complete implementation of a recursive function sum allintegers(), which takes an input n and adds all integers preceding it, up to n: add all integers(n):
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. Examples decimal_to_binary(7) should return 111 decimal_to_binary(128) should return 10000000 decimal_to_binary(5) should return 101 Make sure your function signature matches the given function decimal_to_binary(decimal_number) because I will be using unit tests to evaluate your code. Return an integer representing the binary number from the function, not a string representation. Python