Basic Python practice question
Basic Python Programs (Practice question)
1. Basic of two numbers in the python?
Code:
def maximum (a, b) :
if a > = b :
return b
a = 2
b = 4
print (maximum (a, b))
Output 4
2.Python Program for finding Simple interest
Code:
def simple _ interest (p , t , r)
print ('The simple (principal is ; p)
print ('The time period is ; t )
print ('The rate of interest is ; r)
si = (p * t* r)/100
print ('The simple interest is ; si)
return si ;
simple _interest (8,6,8)
Output
The principal is 8
The time period is 6
The rate of interest is 8
The simple interest is 3.84
3. Python Program for finding compound Interest?
Code:
def compound_interest (principal , rate , time ),
Amount = principal*(Row((1+rate/1000),time)
CI = Amount-Principal
Print("compound interest is" , CI)
Compound _interest (1000 , 1025 , 5)
Output :
Compound interest is 6288.946267
4. Python Program to print all prime number in an interval
Code:
Start = 11
end = 25
for i in range (start , end+1):
if i >1:
for j in range (0, i):
if (i?%j= = 0):
break
else:
print(i)
Output:
11
13
17
19
23
5. Python Program for finding area of circle?
Code:
def findAera(r):
PI = 3.142
return PI*(r*r):
Print ("Area is %0.6f".%findArea (5));
Output:
Area is 78.50
6. Python Program for n--th fibonacci Number?
Code:
def fibonacci (n):
if n < = 0:
print("Incorrect Input")
elif n = = 1:
return 0
elif n = = 2 :
return 1
else :
return fibonacci (n-1)+fibonacci (n-2)
print (fibonacci(10))
Output: 34
7.Python Program for how to check if a given number is fibonacci number?
Code: import math
def is perfect square (x):
s = int(math.sqrt(x))
return s*s = = x
def isfibonacci (n):
return is perfectSquare (5*n*n+4)
for i in range (1,5):
if (isfibonacci (i) = = True):
print i,"is a fibonacci Number "
else :
print i, "is not a fibonacci Number"
Output:
1 is a fibonacci number
2 is a fibonacci number
3 is a finonacci number
4 is not a fibonacci number
8. Python Program for Sum of Square of first n natural numbers
Code: def squareSum (n):
sm = 0
for i in range (1, n+1):
sm = sm+(1*1)
return sm
n = 4
print (SquareSum (n))
Output : 30
9. Python Program for cube sum of first n numbers
Code: def sumofseries(n)
sum = 0
for i in range (1, n+1):
sum + i*i*i
return sum
n = 5
print (sumofseries(n))
Output : 225
10. Python to find sum of the array
Code: def_ sum(arr):
sum = 0
for i in arr:
sum = sum+i
return sum
arr = []
arr = [12 , 3 , 4 , 15]
n = len (arr)
ans = -sum(arr)
print ('sum of the array is ; ans)
Output : Sum of the array is 34
11. Python Program for find minimum sum of factors
Code: def find MinSum(sum):
sum = 0
i = 2
while (i*i < = num):
Sum+ = i
num / = i
i+ = 1
Sum + = num
return Sum
num = 12
print find Minsum(num)
Output: 7
12. Check if a triangle of positive area is positive with given angles?
Code: def isTriangleExist (a, b ,c):
if(a! = 0 and n! = 0 and c! = 0 and (a+b+c) = = 180):
if ((a+b)> = c or (b+c) > = a or (a+c) > = b:
return "YES"
else :
return "NO"
a , b , c = 50 , 60 , 70
print (isTrinagleExist(50, 60 ,70))
Output: YES
13. Python Program for find minimum sum of factors of number.
Code: import math
def maxprimefactors (n):
maxprime = -1
while n%2 = = 0:
maxprime = 2
n >> = 1
for i in range (3,int (math.sqrt(n))+(1,2))
while n %i = = 0:
maxprime = i
if n>>2:
max prime = n
return int (maxprime)
n = 15
print (maxprimefactors(n))
n =25698751364526
print(maxprimefactors(n))
Output:5
328513.
14. Check if Binary representation is palindrome?
Code: def binarypalindrome(num):
binary = bin(num):
binary = binary [2:]
return binary = = binary [-1::1-1]
if----name----- = "----main-----"
num = 9
print binarypalindrome (num)
Output: True
15. Python Program for find sum of odd factors of a number?
Code: import math
def SumOfoddFactors(n):
res = 1
while n%2 = = 0:
n = n //2
for i in range (3, int (math.sqrt(n)+1))
count = 0
curr_sum = 1
curr_term = 1
while n%i = = 0:
count + = 1
n = n//i
curr_term * = i
curr_sum + = curr_term
res* = curr_sum
if n > = 2 :
res* = (1+n)
return res
n = 30
print(sumofoddfactor(n))
Output: 24
Comments
Post a Comment