Q3) Write a recursive function that reads from the keyboard a set of characters and prints them backwards. Use the full-stop character (.) to determine the program. An example of the program input/output session should be as follow: Enter a character (. To end)? A Enter a character (. To end)? B Enter a character (. To end)? C Enter a character (. To end)?. CBA Q4) Write a function that reads number as seconds, the function should prints the hours, minutes and second of the numbers.

Q3) Write a recursive function that reads from the keyboard a set of characters and prints them backwards. Use the full-stop character (.) to determine the program. An example of the program input/output session should be as follow: Enter a character (. To end)? A Enter a character (. To end)? B Enter a character (. To end)? C Enter a character (. To end)?. CBA Q4) Write a function that reads number as seconds, the function should prints the hours, minutes and second of the numbers.

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

Similar questions

Create a recursive function that checks if a word is a palindrome. A palindrome is a word, phrase, number, or other sequences of characters that reads the same forward and backward (ignoring spaces, punctuation, and capitalization). For example, "radar" is a palindrome.
c++ Implement a function that recursively calculates the nth number in the Fibonacci sequence of numbers. The Fibonacci sequence starts at 0 and 1. Each number thereafter is the sum of the two preceding numbers. This gives us the following first ten numbers: 0,1,1,3,5,8,13,21,34, .... Input Expected output0 01 17 139 34
Computer Science A) If the values of c and d are given and the function Euclid(c,d) below is executed, multiple recursive calls (Bolded at function) are performed to obtain gcd(c,d) and terminate. Give examples of c and d that make exactly 7 recursive calls, and show the process. However, c>d>=1. Euclid(c,d) if d=0 then return c else return Euclid(d,c mod d)
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
A 5-digit positive integer is entered through the keyboard, write a function to calculate multiplication of digits of the 5-didit number (1) without using recursion (2) using recursion
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.
4.3.1: Calling a recursive function. Write a statement that calls the recursive function backwards_alphabet() with input starting_letter.Sample output with input: 'f'f e d c b a def backwards_alphabet(curr_letter):if curr_letter == 'a':print(curr_letter)else:print(curr_letter)prev_letter = chr(ord(curr_letter) - 1)backwards_alphabet(prev_letter) starting_letter = input() ''' Your solution goes here '''
: Write a recursive function to multiply two positive integers without usingthe * operator (or / operator). You can use addition, subtraction, and bit shifting, but you shouldminimize the number of those operations.
Consider the following recursive function: def rec1(aList,first,last): if first==last: return aList[first] else: return aList[last]*rec1(aList,first,last-1) Show the output of the following call (show your work and all recursive calls): print(rec1([1,2,3,4,5,6,7],3,5))? describe the task of the rec1 function.
please code in python Write a recursive function power(x, n), where n is 0 or a postive integer. For example, power(2, 10) will return 1024. Write a suitable base case, and for the general case use the idea that x**n = x * (x**n-1).