Python Programming for BVOC 4th Semester (BVNSD 4.1)

To write a python program to check given number is odd or even.

num = int(input("Enter a number: "))
if (num % 2) == 0:
print(num,"is even number");
else:
print(num,"is odd number")

Output

To write a python program to find greater number among 3 numbers.

num1 = int(input("Enter first number: "))
num2 = int(input("Enter second number: "))
num3 = int(input("Enter third number: "))

if (num1 >num2) and (num1 >num3):
   largest = num1
elif (num2 >num3):
   largest = num2
else:
   largest = num3

print("The largest number is", largest)

Output

To write a python program to find factorial of given number.

n = int(input("Enter input number : "))
fact = 1

if n < 0:
   print("Factorial does not exist for negative numbers")
elif n == 0:
   print("The factorial of 0 is 1")
else:
   for i in range(1, n + 1):
       fact = fact * i
print("The factorial of",n,"is",fact)

Output

To write a python program to print Fibonacci series.

num = int(input("Enter the limit greater than 1: "))
a = 0
b = 1
print("Fibonacci series :",end=" ");
for n in range(0, num):
   if(n <= 1):
       t = n
   else:
       t = a + b
       a = b
       b = t

print(t,end=" ")

Output

To write a python program to sum of digit of given integer

num = int(input("Enter 3-digit number : "))
sum = 0
temp = num
while temp > 0:
   digit = temp % 10
   sum = sum + digit
   temp = temp//10

print("Sum of digit is ",sum)

Output

To write a python program to check given integer is palindrome or not.

num = int(input("Enter 3-digit number : "))
sum = 0
temp = num
while temp > 0:
   digit = temp % 10
   sum = sum *10+ digit
   temp = temp//10
if sum==num:
   print("It is a Palindrome number")
else:
   print("It is not a Palindrome number")

Output

To write a python program to check number is Armstrong or not.

num = int(input("Enter 3-digit number : "))
sum = 0
temp = num
while temp > 0:
   digit = temp % 10
   sum = sum + digit * digit * digit
   temp = temp//10

if sum==num:
print("It is an Armstrong number")
else:
print("It is not an Armstrong number")

Output

To write a python program to find factorial of given number using recursion.

def fun_factorial(n):

   if n == 1:
       return n
   else:
       return n* fun_factorial (n-1)

num = int(input("Enter a number: "))
if num < 0:
   print("Sorry, factorial does not exist for negative numbers")
elif num == 0:
   print("The factorial of 0 is 1")
else:
   print("The factorial of",num,"is", fun_factorial (num))

Output

To write a python program to compute the GCD of two numbers.

def fun_GCD( a, b):

if a > b:

temp = b

else:

temp = a

for i in range(1, temp + 1):

if (( a % i == 0) and (b % i == 0 )):

gcd = i

return gcd

return -1

x = int(input (" Enter the first number: ") )

y =int (input (" Enter the second number: "))

num = fun_GCD (x, y)

if num==-1:

print("GCD cannot find..")

else:

print("GCD of two number is: ",num)

Output

To write a python program exponentiation (power of a number).

def fun_Power( a, b):
   if b==0:
       return 1
   elif b==1:
       return a
   else:
       temp=1
       for i in range(1, b+1):
           temp=temp*a;

return temp

x = int(input (" Enter any number: ") )
y =int (input (" Enter the power number: "))
num = fun_Power (x, y)
print("Answer is : ",num)

Output

To write a python program find the maximum of a list of numbers.

def myMax(myList):

max = myList[0]

for x in myList:

if x > max:

max = x

return max

myList = []

num=int(input("Enter number of elements in list: "))

for i in range(1, num + 1):

a = int(input("Enter elements: "))

myList.append(a)

y=myMax(myList)

print("Largest element is:", y)

Output

To write a python program to implement linear search.

def myLSearch(myList,num,snum):
   f=0;
   for x in range(0,num):
       if snum==myList[x]:
           f=1
           break
   if f==1:
       print("Number is present")
   else:
       print("Nomber is not present")

myList = []
num = int(input("Enter total number of elements in list: "))
for i in range(0, num):
a = int(input("Enter elements: "))
myList.append(a)

snum = int(input("Enter number to be search: "))
y=myLSearch(myList,num,snum)

Output

To write a python program to implement Binary search.

def myBSearch(myList, n):

low = 0

high = len(myList) - 1

mid = 0

while low <= high:

mid = (high + low) // 2

if myList[mid] < n:

low = mid + 1

elif myList[mid] > n:

high = mid - 1

else:

return mid

return -1

myList = []

n = int(input("Enter total number of elements in list: "))

for i in range(0, n):

a = int(input("Enter elements: "))

myList.append(a)

snum = int(input("Enter number to be search: "))

res = myBSearch(myList, snum)

if res != -1:

print("Element is present at index", str(res))

else:

print("Element is not present in list1")

Output

To write a python program to implement Bubble Sort

def bubbleSort(arr,n):
   for i in range(0,n-1):
       for j in range(0, n-1-i):
           if arr[j] > arr[j + 1]:
               temp=arr[j]
               arr[j]=arr[j+1]
               arr[j+1]=temp

arr = []
n = int(input("Enter total number of elements in list: "))
for i in range(0, n):
a = int(input("Enter elements: "))
arr.append(a)

print("\n Before Sorting array is:")
for i in range(0,n):
print("% d" %arr[i],end=" ")
bubbleSort(arr,n)
print("\n After Sorting array is:")
for i in range(0,n):
print("% d" %arr[i], end=" ")

Output

To write a python program to implement selection sort.

def selectionSort(arr,n):
   for i in range(0,n):
       for j in range(i+1, n):
           if arr[i] > arr[j]:
               temp=arr[i]
               arr[i]=arr[j]
               arr[j]=temp

arr = []
n = int(input("Enter total number of elements in list: "))
for i in range(0, n):
a = int(input("Enter elements: "))
arr.append(a)

print("\nBefore Sorting array is:",end=" ")
for i in range(0,n):
print(arr[i],end=" ")
selectionSort(arr,n)
print("\nAfter Sorting array is:",end=" ")
for i in range(0,n):
print(arr[i], end=" ")

Output