S.

Aswin
20234012404106

Print the Sequence of Natural Numbers both in Ascending and Descending

Order

Source Code:
def asc_desc(n):

if n>0:

print(n,end = '')

asc_desc(n-1)

print(n,end = '')

print("\n\tSequence of Natural Numbers in Ascending and Descending Order")

num_terms = int(input("\nEnter the number of Natural Numbers:"))

print("\nDescending and Ascending order:\n")

asc_desc(num_terms)
 S.Aswin
20234012404106

Output:
 S.Aswin
20234012404106

Compute the Sum of N Natural Numbers

Source Code:
def sum_of_numbers(n):

if n == 0:

return 0

else:

return n+sum_of_numbers(n-1)

print("\n\t Compute Sum of N Numbers")

N = int(input("\nEnter the value of N:"))

result = sum_of_numbers(N)

print(f"\nThe Sum of the first {N} Natural Numbers is:{result}")

 S.Aswin
20234012404106

Output:
 S.Aswin
20234012404106

Calculate the Factorial of a given Number

Source Code:
def factorial_recursive(n):

if n==0 or n==1:

return 1

else:

return n*factorial_recursive(n-1)

print("\n\t Calculate the Factorial of an Number")

num = int(input("\nEnter a number to calculate its factorial:"))

result = factorial_recursive(num)

print(f"\nThe factorial of {num} is : {result}")

 S.Aswin
20234012404106

Output:
 S.Aswin
20234012404106

Find the Power of a Number(mn)

Source Code:
def calculate_power(base,exponent):

if exponent == 0:

return 1

else:

return base * calculate_power(base,exponent-1)

print("\n\t Find The Power of An Number")

base_value = int(input("\nEnter Base Value:"))

exponent_value = int(input("\nEnter Exponent Value:"))

result = calculate_power(base_value,exponent_value)

print(f"\nThe Result of {base_value}^{exponent_value} is :{result}")

 S.Aswin
20234012404106

Output:
 S.Aswin
20234012404106

Generate the Fibonacci Series

Source Code:
def fibonacci_recursive(n):

if n<=1:

return n

else:

return fibonacci_recursive(n-1) + fibonacci_recursive(n-2)

print("\n\tGenerating the Fibonacci Series")

num_terms = int(input("\nEnter the Number of Element:"))

print("\nFibonacci Series:\n")

for i in range(num_terms):

print(fibonacci_recursive(i),end = '')
 S.Aswin
20234012404106

Output: