0% found this document useful (0 votes)
5 views

Programs from Module1

Uploaded by

bhuvanvasa23s
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views

Programs from Module1

Uploaded by

bhuvanvasa23s
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

# program to find factorial of a given number

n=int(input("Enter the number: ") )


f=1
while n>0:
f=f*n
n=n-1
print("Factorial is",f)

--------------------------------------------------------------
# if condition demo
a=3
b=20
if a>b:
print("a is big")
print("a value is", a)
else:
print("b is bigger")
print('b value:', b)
print("End of Program")
--------------------------------------------------------------
# Even or Odd
a=int(input("Enter a value: "))
if (a%2)==0:
print("a is EVEN number")
else:
print("a is ODD Number")

# WAP in Python Find the biggest of three numbers


# fiding the biggest among 3 numbers
a=int(input('Enter a number'))
b=int(input('Enter a number'))
c=int(input('Enter a number'))
if a>b and a>c:
print('a is bigger')
elif b>c and b>a:
print('b is bigger')
else:
print(' c is bigger')
print('End of program')
------------------------------------------------------------
#WAP to print the given number +ve or -Ve or ==zero
n=int(input('Enter a number'))
if n==0:
print('Given number is zero')
elif n<0:
print('Given number is negative')
else:
print('Given number is positive')

print('End of Program')
--------------------------------------------------------------
# elif demo2
n=int(input('Enter a number between 1-10'))
if n==1: print('You have entered 1')
elif n==2: print('You have entered 2')
elif n==3: print('You have entered 3')
elif n==4: print('You have entered 4')
elif n==5: print('You have entered 5')
elif n==6: print('You have entered 6')
elif n==7: print('You have entered 7')
elif n==8: print('You have entered 8')
elif n==9: print('You have entered 9')
elif n==10: print('You have entered 10')
else: print('Entered an incorrect number')
-------------------------------------------------------------------
# to find sum of digits of a number
n=int(input("Enter a number"))
sum=0
while n>0:
rem=n%10
sum+=rem
n=n/10
print("Sum of digits=", int(sum))
------------------------------------------------------------------
# countdown using while loop
n=int(input("Enter the number: ") )

while n>0:
print(n)
n=n-1
print('End of Program')

# natural numbers upto N


n=int(input("Enter the number: ") )
i=1
while i<=n:
print(i)
i=i+1
print('End of Program')

# even numbers upto N


n=int(input("Enter the number: ") )
i=2
while i<=n:
print(i)
i=i+2
print('End of Program')

# odd numbers upto N


n=int(input("Enter the number: ") )
i=1
while i<=n:
print(i)
i=i+2
print('End of Program')
-------------------------------------------------------------
# Factorial using for loop
n=int(input("Enter the number: "))
f=1
for i in range(1,n+1):
f=f*i
print ("Factorial=",f)
--------------------------------------------------------------
# factorial-Method 1
n=int(input("Enter the number: ") )
f=1
while n>0:
f=f*n
n=n-1
print("Factorial is",f)

# factorial: Method 2
n=int(input("Enter the number: ") )
i=1
f=1
while i<=n:
f=f*i
i=i+1
print("Factorial is",f)
----------------------------------------------------------------
# Using for loop, WAP to print
# decimal equivalents of 1/2, 1/3, 1/4,....1/10
# Way-1
list1=[2,3,4,5,6,7,8,9,10]
for i in list1:
print(1/i)

#WAY-2
i=1
for j in range(2,11):
print(i,'/',j,'=',i/j)
#print(i/j)
print('End of Program')

#WAY-3: List Comprehensions/computed List


divisions=[(1/i) for i in range(2,11)]
print(divisions)
--------------------------------------------------------------
#squares of list of numbers
list1=[1,2,3,4,5,6,7,8,9,10]
squares=[]
for i in list1:
squares.append(i**2)
print(squares)
print('End of Program')

# Way2: List Comprehensions/Computed Lists


squares=[i**2 for i in range(1,11)]
print(squares)

cubes=[i**3 for i in range(1,11)]


print(cubes)

# example 3
list1=[10,20,30]
list2=[10,40,50]
print([(x,y) for x in list1 for y in list2 if(x!=y)])
------------------------------------------------------
# break usage
for i in range(1,11):
if(i==5):
break
print(i)
print('END')

# continue usage
for i in range(1,11):
if(i==5):
continue
print(i)
print('END')

# pass usage
for i in range(1,11):
if(i==5):
pass
print(i)
print('END')

------------------------------------------------------------
# Fibonacci n terms
n=int(input("Enter n value ") )
f0=0
f1=1
print(f0,'\n',f1)
for i in range(1,n-1):
f2=f0+f1
print(f2)
f0=f1
f1=f2
print ("\nEnd of Program")

-----------------------------------------------------------
# Fibonacci even terms sum
n=int(input("Enter n value ") )
f0=0
f1=1
print(f0,'\n',f1)
even_sum=0
odd_sum=1
for i in range(1,n-1):
f2=f0+f1
print(f2)
if (f2%2)==0:
even_sum+=f2
else:
odd_sum+=f2
f0=f1
f1=f2
print('Even terms sum=', even_sum)
print('Odd terms sum=', odd_sum)
print ("\nEnd of Program")
-------------------------------------------------------------
# prime or not?
n=int(input("Enter the n value"))
count=0
for i in range(2,n):
if n%i==0:
count=count+1
break
if count==0:
print(n,"is Prime Number")
else:
print("Not Prime Number")
print('End of Program')

# sum of primes below 2 Million


n=2000000
count=0
sum=0
for i in range(2,n):
for j in range(2,i):
if i%j==0:
count=count+1
break
if count==0:
print(i)
sum=sum+i
print("Sum of Primes below 2 Million=", sum)
print('End of Program')
--------------------------------------------------------------------
#python program finds the sum of digits using for loop statement.
# Method-1
num=input("Enter a number:")
sum=0
for n in num:
sum = sum + int(n)
print(sum)

# Method-2: using while loop


n=int(input("Enter a number:"))
sum=0
while (n!=0):
rem=n%10
sum+=rem
n=n//10
print('Sum of the digits=',sum)
--------------------------------------------------------------------

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy