Write a recursive function called print_num_pattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or 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. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12

Write a recursive function called print_num_pattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or 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. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12

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

please solve in python and give code. thankzz
Given the recursive function below where n is an integer: if n = 0 or n = 1 or n = 2 f(n) = {f(n – 2) + f(n – 4) otherwise Which of the following statements is true? IMPORTANT: There is no "Check" button for this question. You can change the answer as many times as you like. Select one: O a. The function terminates if and only if n is 1 or even. O b. The function terminates if and only if n24. O . The function terminates if and only if n=1 or n is even and greater or equal to 0. O d. The function terminates if and only if n is 0, 1 or 2. O e. The function terminates if and only if n20.
A palindrome is a sentence that contains the same sequence of letters reading it either forwards or backwards. A classic example is '1\.ble was I, ereI saw Elba." Write a recursive function that detects whether a string is apalindrome. The basic idea is to check that the first and last letters of thestring are the same letter; if they are, then the entire string is a palindromeif everything between those letters is a palindrome.There are a couple of special cases to check for. If either the first orlast character of the string is not a letter, you can check to see if the restof the string is a palindrome with that character removed. Also, when youcompare letters, make sure that you do it in a case-insensitive way.Use your function in a program that prompts a user for a phrase andthen tells whether or not it is a palindrome. Here's another classic fortesting: '1\. man, a plan, a canal, Panama!"
Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"
Write a program that uses a recursive function, decToBin, to convert a non- negative integer in decimal format (that is base 10) into the equivalent binary number (that is base 2). In the main function, prompt the user to enter a non-negative integer in decimal format, then output its equivalent number in binary format
The code is already given above. Problem: Using PYTHON, create a code that asks you to enter three numbers: a, b, and x. Create a recursive function that takes in 3 inputs and prints the multiples of x in the range [a,b] V a and b will serve as lower and upper bounds of the range where the multiples of x will be searched on. v if x is odd, print the multiples in ascending order. V if x is even, print the multiples in descending order. The value of input a will always be less than or equal to input b. The difference between a and b will be limited to a maximum of 200 to avoid Python's "maximum recursion depth exceeded in comparison" error. Example of Input #1 Example of Ouput #1 Example of Input #2 Example of Input #2 -10 Please enter a: -10 Please enter a: 1 Please enter b: 10 Please enter x: 2 10 8 6 4 2 1 10 Please enter b: 10 10 3 Please enter x: 3 -9 -6 -3 0 3 6 9 Example of Input #3 Example of Output #3 1 Please enter a: 1 Please enter b: 2 7 Please enter x: 7
Computer scientists and mathematicians often use numbering systems other than base 10. Write a program that allows a user to enter a number and a base and then prints out the digits of the number in the new base. Use a recursive function baseConversion (num, base) to print the digits. Hint: Consider base 10. To get the rightmost digit of a base 10 number, simply look at the remainder after dividing by 10. For example, 153 % 10 is 3. To get the remaining digits, you repeat the process on 15, which is just 153 // 10. This same process works for any base. The only problem is that we get the digits in reverse order (right to left). The base case for the recursion occurs when num is less than base and the output is simply num. In the general case, the function (recursively) prints the digits of num // base and then prints num % base. You should put a space between successive outputs, since bases greater than 10 will print out with multi-character "digits." For example, baseConversion(1234,…
write in java
Python Programming
Write a statement that calls the recursive function backwards_alphabet() with input starting_letter. Sample output with input: 'f f e d b a 344614.2214230.qx3zgy7 1 def backwards_alphabet (curr letter): if curr_letter print(curr_letter) 2 'a': == 3 4 else: print (curr_letter) prev_letter backwards_alphabet (prev_letter) 5 chr (ord(curr_letter) 1) 7 9 starting_letter = input () 10 Your solution goes here ... 11 12
python