Jitendra Singh

Count and display the number of vowels, consonants, uppercase, lowercase characters in string   # Vowels & Consonants count str = input(“Type the string: “) vowel_count=0 consonants_count=0 vowel = set(“aeiouAEIOU”) for alphabet in str: if alphabet in vowel: vowel_count=vowel_count +1 elif alphabet == chr(32): consonants_count=consonants_count else: consonants_count=consonants_count+1 print(“Number of Vowels in “,str,” is :”,vowel_count) print(“Number … Read more

Compute the greatest common divisor and least common multiple of two integers   # GCD PROGRAM num1 = int(input(“Enter 1st number: “)) num2 = int(input(“Enter 2nd number: “)) i = 1 while(i <= num1 and i <= num2): if(num1 % i == 0 and num2 % i == 0): gcd = i i = i … Read more

Display the terms of a Fibonacci series Python Program   # Program to display the Fibonacci sequence up to n-th term nterms = int(input(“How many terms ? “)) # first two terms n1, n2 = 0, 1 count = 0 # check if the number of terms is valid if nterms <= 0: print(“Please enter … Read more

Input a number and check if the number is a prime or composite number Python Program   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, it is a COMPOSITE number”) break else: print(num, “is a … Read more

Determine whether a number is a perfect number an armstrong number or a palindrome Python Program   # Palindrome (12321 is Palindrome) number=int(input(“Enter any number:”)) num=number num1= number rev=0 while num>0: digit=num%10 rev=rev*10+digit num=int(num/10) if number==rev: print(number ,’is a Palindrome’) else: print(number , ‘Not a Palindrome’) # Armstrong number is equal to sum of cubes … Read more