Scribd
Upload
39 views4 pages

Python Programs

Uploaded by

BTCST
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
39 views4 pages

Python Programs

Uploaded by

BTCST
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 4

1. Write a python program to input a welcome message and display it.

message=input("Enter welcome message : ")


print("Hello, ",message)

2. Write a python program to input two numbers and display the larger / smaller number.

3. Write a python program to input three numbers and display the largest / smallest number.
number1 = int(input('Enter First number : '))
number2 = int(input('Enter Second number : '))
number3 = int(input('Enter Third number : '))def largest(num1, num2, num3):
if (num1 > num2) and (num1 > num3):
largest_num = num1
elif (num2 > num1) and (num2 > num3):
largest_num = num2
else:
largest_num = num3
print("The largest of the 3 numbers is : ", largest_num)def smallest(num1,
num2, num3):
if (num1 < num2) and (num1 < num3):
smallest_num = num1
elif (num2 < num1) and (num2 < num3):
smallest_num = num2
else:
smallest_num = num3
print("The smallest of the 3 numbers is : ", smallest_num)largest(number1,
number2, number3)
smallest(number1, number2, number3)

4. Generate patterns using a nested loop.

SOURCE CODE-1

SOURCE CODE-2
SOURCE CODE-3

5. Write a program to input the value of x and n and print the sum of the following series:
1) 1 + x² + x³ + … + xⁿ
x = float (raw_input (“Enter value of x :”)
n = int (raw_input (“Enter value of n :”))
s=0
for a in range (n + 1) :
s + = x**a
print “Sum of series”, s

2) x – x2/2! + x3/3! – x4/4! + x5/5! – x6/6!


X = int(raw_input("Enter the value for x:"))
j = int(raw_input("Enter The value for j:"))
Sum = 0
Fact = 1
Sign = 1
for i in range(1,x+1):
for i in range(1,j+1):
Fact = Fact*1
Sum += (Sign*(X**i)/Fact*j

6. Write a program to determine whether a number is a perfect number, an Armstrong number


or a palindrome.
number = int(input("Enter a number: "))
sum = 0
temperature = number

while temperature > 0:


digit = temperature % 10
sum += digit ** 3
temperature //= 10

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

7. Write a program to input a number and check if the number is a prime or composite number.
num = int(input("Enter any number : "))
if num > 1:
for i in range(2, num):
if (num % i) == 0:
print(num, "is NOT a prime number")
break
else:
print(num, "is a PRIME number")
elif num == 0 or 1:
print(num, "is a neither prime NOR composite number")
else:
print(num, "is NOT a prime number it is a COMPOSITE number")

8. Write a program to display the n terms of a Fibonacci series.


n = int(input("Enter the value of 'n': "))
a=0
b=1
sum = 0
count = 1
print("Fibonacci Series: ", end = " ")
while(count <= n):
print(sum, end = " ")
count += 1
a=b
b = sum
sum = a + b
9. Write a python program to compute the greatest common divisor and least common multiple
of two integers.
def gcd(x, y):
gcd = 1
if x % y == 0:
return y
for k in range(int(y / 2), 0, -1):
if x % k == 0 and y % k == 0:
gcd = k
break
return gcd
print("GCD of 12 & 17 =",gcd(12, 17))
print("GCD of 4 & 6 =",gcd(4, 6))
print("GCD of 336 & 360 =",gcd(336, 360))

10. Write a program to count and display the number of vowels, consonants, uppercase, lowercase
characters in the string.
s = input("Enter any string :")
vowel = consonent = uppercase = lowercase= 0
for i in s:
if(i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u'or i == 'A'or i ==
'E' or i == 'I' or i == 'O' or i == 'U'):
vowel = vowel +1
else:
consonent = consonent + 1
if i.isupper() :
uppercase = uppercase + 1

if i.islower():
lowercase = lowercase + 1

print("Total number of vowel:",vowel)


print("Total number of consonent:",consonent)
print("Total number of uppercase letter:",uppercase)
print("Total number of lowercase letter:",lowercase)

You might also like