PYTHON:
(Sum the digits in an integer using recursion)
Write a recursive function that computes the sum of the digits in an integer. Use the following function header:
def sumDigits(n):
For example, sumDigits(234) returns 9. Write a test program that prompts the user to enter an integer and displays the sum of its digits.
Sample Run
Enter an integer: 231498
The sum of digits in 231498 is 27
def sumDigits(num):
if(num <= 9):
return num
else:
return (num%10) + sumDigits(num//10)
def main():
n = eval(input("Enter an integer: "))
print("The sum of digits in",n,"is",sumDigits(n))
main()



PYTHON: (Sum the digits in an integer using recursion) Write a recursive function that computes the...
1. (Sum the digits in an integer) Write a method that computes the sum of the digits in an integer. Use the following method header: public static int sumDigits(long n) For example, sumDigits (234) returns 9 (2 + 3 + 4). (Hint: Use the % operator to extract digits, and the / operator to remove the extracted digit. For instance, to extract 4 from 234, use 234 % 10(= 4). To remove 4 from 234, use 234 / 10(= 23)....
Write a function that returns the number of digits in an integer using the following header: int getSize(int n) For example, getSize(45) returns 2, getSize(3434) returns 4, getSize(4) returns 1, and getSize(0) returns 1. Write a test program that prompts the user to enter an integer and displays its size.
****python****
Q1.
Write a recursive function that returns the sum of all numbers
up to and including the given value.
This function has to be recursive; you may not use loops!
For example:
Test
Result
print('%d : %d' % (5, sum_up_to(5)))
5 : 15
Q2,
Write a recursive function that counts the number of odd
integers in a given list.
This function has to be recursive; you may not use loops!
For example:
Test
Result
print('%s : %d' % ([2,...
Write a recursive function in Python to find the sum of digits
of a number. Name the function sum_of_digits. The function should
use recursive algorithm (calling itself). The function should print
out the sum of all the digits of a given number. For example,
sum_of_digits(343) should have a output of 10. Marks will be
deducted if you do not follow strictly to the
instructions.
[3]: N 1 def sum_of_digits(n): HNM in sum_of_digits (343) Out[3]: 10
Python (Convert milliseconds to hours, minutes, and seconds) Write a function that converts milliseconds to hours, minutes, and seconds using the following header: def convertMillis(millis): The function returns a string as hours:minutes:seconds. For example, convertMillis(5500) returns the string 0:0:5, convertMillis(100000) returns the string 0:1:40, and convertMillis(555550000) returns the string 154:19:10. Write a test program that prompts the user to enter a value for milliseconds and displays a string in the format of hours:minutes:seconds. Sample Run Enter time in milliseconds: 555550000...
need help with python ( no loops used please!)
Write a recursive function named sum_digits that takes a given a non-negative integer N and returns the sum of its digits. Hint: Mod (%) by 10 gives you the rightmost digit (126 % 10 is 6), while doing integer division by 10 removes the rightmost digit (126/10 is 12). This function has to be recursive; you are not allowed to use loops to solve this problem! This function takes in one...
In Python 3
(2.5 pts] Write the recursive function thirtyTwos(n) that takes an integer greater or equal to 0 and returns an integer that represents the number of times that a 2 directly follows a 3 in the digits of n. Hint: The % and // operations from sumDigits could be helpful here >>> thirtyTwos (132432601)
Using PYTHON: (Find the index of the smallest element) Write a function that returns the index of the smallest element in a list of integers. If the number of such elements is greater than 1, return the smallest index. Use the following header: def indexOfSmallestElement(lst): Write a test program that prompts the user to enter a list of numbers, invokes this function to return the index of the smallest element, and displays the index. PLEASE USE LISTS!
In Java, write a recursive method that converts an integer to hexadecimal. The function should print out the hexadecimal character instead of returning the character. Write a test program that prompts the user to enter an integer and displays its hexadecimal equivalent.
write a recursive function that returns true if the digits of a positive integer are in increasing order ; otherwise, the function returns false. Also write a program to test your function.