Lab Program
Lab Program
OUTPUT
PROGRAM 2
if(a>b):
large=a
small=b
else:
large=b
small=a
print("Largest Number:",large)
print("Smallest Number:",small)
OUTPUT
if(a>b)and(a>c):
larg=a
elif(b>c):
larg=b
else:
larg=c
if(a<b)and(a<c):
small=a
elif(b<c):
small=b
else:
small=c
y=pow(x,n)
OUTPUT
sum=1
for i in range(1,n+1):
sum=sum+((x**i))
OUTPUT
sum=1
for i in range(1,n+1):
sum=sum+((x**i)*((-1)**i))
OUTPUT
sum=x
for i in range(x,n+1):
sum=sum+(((x**i)/i)*((-1)**i))
OUTPUT
sum=x
fact=1
for i in range(x,n+1):
fact=fact*i
sum=sum+(((x**i)/fact)*((-1)**i))
OUTPUT
sum=0
if num% i==0:
sum=sum+i
if num==sum:
else:
OUTPUT
it is a perfect number
2) PROGRAM FOR ARMSTRONG NUMBER
tot=0
temp=num
while temp>0:
dig=temp%10
tot+=dig**3
temp//=10
if num==tot:
else:
OUTPUT
n=int(input("enter a number:"))
temp=n
rev=0
while(n>0):
dig=n%10
rev=rev*10+dig
n=n//10
if (temp==rev):
else:
OUTPUT
enter a number:222
isprime= True
for i in range(2,num):
if (num%i)==0:
isprime=False
break
if(isprime):
else:
OUTPUT
17 is a prime number
a=0
b=1
sum=0
count=1
print("Fibonacci series:",end="")
while(count<=num):
print(sum,end="")
count+=1
a=b
b=sum
sum=a+b
OUTPUT
Fibonacci series:01123
9)COMPUTE THE GREATEST COMMON DIVISOR AND LEAST COMMON MULTIPLE OF TWO INTEGERS
if x>y:
small=y
else:
small=x
for i in range(1,small+1):
if((x%i==0)and (y%i==0)):
hcf=i
lcm=(x*y)/hcf
OUTPUT
uc=lc=0
for a in word:
if a.islower():
lc=lc+1
elif a.isupper():
uc=uc+1
OUTPUT
vc=cc=0
str=str.lower()
for i in range(0,len(str)):
if ( str[i] in ('a','e','i','o','u')):
vc=vc+1
cc=cc+1
OUTPUT
str2=input("enter a string:")
rev=str2[::-1]
if(rev==str2):
else:
if(str2.isupper()):
print(str2.lower())
elif(str2.islower()):
print(str2.upper())
OUTPUT
enter a string:madam
MADAM
enter a string:PYTHON
python
12)FIND THE LARGEST/SMALLEST NUMBER IN LIST/TUPLE
lst=[]
for n in range(num):
lst.append(number)
OUTPUT
evenpos=[]
oddpos=[]
for i in range(0,len(x)):
if i%2==0:
evenpos.append(x[i])
else:
oddpos.append(x[i])
temp=evenpos
evenpos=oddpos
oddpos=temp
OUTPUT
lst=eval(input("enter list:"))
length=len(lst)
for i in range(0,length-1):
if element==lst[i]:
print(element,"found at index",i)
break
else:
OUTPUT
enter list:[2,4,5,6,7]
5 found at index 2
15)INPUT A LIST OF NUMBERS AND TEST IF A NUMBER IS EQUAL TO SUM OF CUBES OF ITS DIGIT. FIND
SMALLEST AND LARGEST SUCH NUMBER FROM GIVEN LIST OF NUMBERS
lst=[]
for n in range(num):
number=int(input("enter number:"))
lst.append(number)
for i in range(len(lst)):
temp=lst[i]
sum=0
while(temp>0):
digit=temp%10
sum+=digit**3
temp//=10
if (lst[i]==sum):
else:
OUTPUT
student_data=["student_name","student_rollno","mark1"]
for i in range(0,n):
dict={'name':student_name,'rollno':student_rollno,'mark1':mark1}
if(int(mark1)>75):
else:
OUTPUT