Following are the programs based on list, for while loops, if statements and functions in Python ### Advanced Programs 1. Programme find the sum of the digits of a number

#n=input("Enter the number: ")
n="3627"
sum=0
for i in range(0,len(n)):
    sum=sum+eval(n[i])
print(sum)
## 18

Alternate programme without assuming the value as string is as follows

#n=eval(input("Enter the number: "))
n=5678965
sum=0
a=n
while a!=0:
    sum=sum+a%10
    a=a//10
print(sum)
## 46
  1. Write a python program to find the first n(assume n=10) Fibonacci numbers
#n=eval(input("Enter the number of Fibonacci numbers to be generated"))
n=10
a=0
b=1
print(a)
## 0
print(b)
## 1
for i in range(0,n-2):
  c=a+b
  print(c)
  a=b
  b=c
## 1
## 2
## 3
## 5
## 8
## 13
## 21
## 34
  1. Write a python program to generate Fibonacci numbers less than some specified number
#n=eval(input("Enter the number of Fibonacci numbers to be generated"))
n=100
a=0
b=1
print(a)
## 0
print(b)
## 1
c=a+b
while(c<=n):
  print(c)
  a=b
  b=c
  c=a+b
## 1
## 2
## 3
## 5
## 8
## 13
## 21
## 34
## 55
## 89
  1. Write a python program to generate check whether the given number is a palindrome number
#num=eval(input("Enter the number to be tested for palindrome"))
num=245646132
a=num
sum=a%10
while (a//10!=0):
  a=a//10
  sum=sum*10+a%10
print(sum)
## 231646542
if (num==sum):
  print("The given number is a palindrome number")
else:
  print("The given number is not a palindrome number")
## The given number is not a palindrome number

Alternatively if we input the number as a string

#num=eval(input("Enter the number to be tested for palindrome"))
num="12321"
a=num
rev=a[::-1]
print(rev)
## 12321
if (num==rev):
  print("The given number is a palindrome number")
else:
  print("The given number is not a palindrome number")
## The given number is a palindrome number
  1. Write a program to check whether the given number is an Armstrong number
n=1634
a=n
# First we have to find the number of digits in the given number as we have to take the power of digits
digits=0
while (a>0):
  digits=digits+1
  a=a//10
a=n
sum=0
for i in range(digits):
  sum=sum+(a%10)**digits
  a=a//10
if (sum==n):
  print("Given number ",n," is an Armstrong Number")
else:
    print("Given number ",n," is not an Armstrong Number")
## Given number  1634  is an Armstrong Number
  1. Write a program to check whether the given number is a prime number
#num=eval(input("Enter the number to be tested"))
num=17
if (num>1):
  for i in range(2,num//2+1):
    if (num%i==0):
      print("Given Number", num,"is not a prime number")
      break
  else:
    print("Given number",num," is prime" )
else: 
  print("Given Number", num,"is not a prime number")
## Given number 17  is prime
  1. Write a program to find the LCM of two numbers
#x=eval(input("Enter the first number"))
#y=eval(input("Enter the second number"))
x=14
y=57
if (x>=y):
  greater=x
  smaller=y
else:
  greater=y
  smaller=x
i=1
while (True):
  if ((greater*i)%smaller==0):
    lcm=greater*i
    break
  else:
    i=i+1
print('LCM of the numbers {:d},{:d} is {:d}'.format(x,y,lcm))
## LCM of the numbers 14,57 is 798
  1. Write the program to print the HCF of two numbers
#x=eval(input("Enter the first number"))
#y=eval(input("Enter the second number"))
x=14
y=57
if (x>=y):
  greater=x
  smaller=y
else:
  greater=y
  smaller=x
i=1
for i in range(smaller,0,-1):
  if(smaller%i==0 and greater%i==0):
    print('HCF of the numbers {:d},{:d} is {:d}'.format(x,y,i))
    break
## HCF of the numbers 14,57 is 1
  1. Write a program to find the maximum of a list without using the max function
list1=[-3,-6,-7,-18,-2,-4,-6]
max=list1[0]
for i in list1:
    if max<=i:
        max=i
print(max)
## -2

  1. Write a program to print the minimum of a list without using min function

  2. Write a program to sort the elements of a list without using sort function

nums=[-2,4,20,-11]
num_sort=[]
for i in range(0,len(nums)):
    min=nums[0]
    for j in nums:
        if min>=j:
            min=j
    num_sort.append(min)
    nums.remove(min)
print(num_sort)
## [-11, -2, 4, 20]
  1. Write a program to find the factorial of a number
#num=eval(input("Enter the number for which factorial has to found out: "))
num=6.5
if num==int(num) and num >=0:
    fact=1
    for i in range(1,num+1):
        fact=fact*i
else:
    fact="Enter a valid number!"
print(fact)
## Enter a valid number!
  1. Write a program to convert a number into binary
num=9
binary=[]
print(len(str(num)))
## 1
while (num>0):
    binary.append(num%2)
    num=num//2

for i in binary:
    print(i,end="")
## 1001
  1. Write a program swap contents of two variables
#a=input ("enter the first no.: ")
#b=input ('enter the second no.: ')
a=10
b="India"
temp=a
a=b
b=temp
print('The swapped numbers are:',a,",",b)
## The swapped numbers are: India , 10
  1. Write a o print first n prime numbers
#n=eval(int(input('Enter the number of primes to be generated: ')))
n=10
list1=[2]
np=1
b=3
while np<n:
    dummy=1
    for i in range (2,b):
      if b%i==0:
        dummy = 0
        break
    if dummy==1:
     np=np+1
     list1.append(b)
    b=b+1
print(list1)
## [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]
  1. Write a program to find the number of prime numbers less than a specified limit
#n=int(input('Enter the limit: '))
n=20
np=1
for i in range (3,n+1,2):
  for r in range(2,i):
    if i%r!=0:
        dummy = 1
        continue
    else:
        dummy=0
        break
  if dummy==1:
    np+=1
print('No. of prime numbers below',n,'is: ',np)
## No. of prime numbers below 20 is:  8

  1. Write a program to print the prime numbers less than a specified number

  2. Write a program to check whether the given year is leap year

#yr=eval(int(input('Enter the year: ')))
yr=1665
if yr%4==0:
    print('The given year is ',yr,' is a leap year')
else:
    print('The given year is ', yr, ' is not  a leap year')
## The given year is  1665  is not  a leap year
  1. Write a program to convert temperature in degree Celsius(c) to Farenheit(F=32+1.8*c)
#c=float(input('Enter the temperature in celcius: '))
c=37.3
F=32+(1.8*c)
print('The temperature in farenheit is: ',F)
## The temperature in farenheit is:  99.14
  1. Write a program to check whether a given number is disarium number.

A disarium number is a number in which the sum of the digits to the power of their respective position is equal to the number itself (position is counted from left to right starting from 1. Example of a Disarium number is 175,\(175=1^1+7^2+5^3= 1 + 49 + 125= 175\). Other examples of disarium numbers are \(89=8^1+9^2\), \(175=1^1+7^2+5^3\), \(598=5^1+9^2+8^3\)

n='89'
sum=0
for i in range(len(n)):
  sum=sum+int(n[i])**(i+1)
if(sum==int(n)):
  print("The given number",n,"is a dasarium number")
else:
  print("The given number",n,"is not a dasarium number")
## The given number 89 is a dasarium number

Alternatively, we can treat it as number to check whether given number os dasarium number

n=518
digits=0
a=n
while (a>0):
  digits=digits+1
  a=a//10
a=n
sum=0
for i in range(digits):
  sum=sum+(a%10)**(digits-i)
  a=a//10
if(sum==n):
  print("The given number",n,"is a dasarium number")
else:
  print("The given number",n,"is not a dasarium number")
## The given number 518 is a dasarium number
  1. Write a program to check whether a given number is a Krishnamurthy number

Any number is a Krishnamurthy number if the sum of the factorial of its digits equals itself. For example \(145=1!+4!+5!=1+24+120\) is a Krishnamurthy number

#define factorial function first
def fact(n):
  if (n<0):
    print("Invalid argument for factorial")
    return None
  elif (n==0):
    k=1
  else:
    k=n*fact(n-1)
  return(k)

sum=0
n=157
a=n
while (a>0):
  sum=sum+fact(a%10)
  a=a//10
if (sum==n):
  print("The given number", n," is a Krishnamurthy number")
else:
  print("The given number", n," is not a Krishnamurthy number")
## The given number 157  is not a Krishnamurthy number
  1. Write a program to check whether a given number is a perfect number

A number for which sum of its positive divisors excluding the number itself is equal to that number is a perfect number. For example, 6 is a perfect number because 6 is divisible by 1, 2, 3 and 6. So, the sum of these values are: 1+2+3 = 6 (Remember, we have to exclude the number itself). Some other perfect numbers are 6, 28

  1. Write a Python program to check whether a given number is a neon number

A neon number is a number where the sum of digits of square of the number is equal to the number. For example consider \(9\), \(9^2=81\) and \(8+1=9\), number itself. Hence \(9\) is a neon number

def SumDigits(x):
  a=x
  sum=a%10
  while(a//10!=0):
    a=a//10
    sum=sum+a%10
  return(sum)

#n=eval(input("Enter the number to be tested for neon number"))
n=12
if (n==SumDigits(n**2)):
  print("The given number {:d} is a neon number".format(n))
else:
    print("The given number {:d} is not a neon number".format(n))
## The given number 12 is not a neon number
  1. Write a program to find the number of ways letters of a word can be arranged (Case insensitive).
word='proBability'
word=word.upper()
print(word)
## PROBABILITY
#define elements as a list to include distinct letters in the given word and number as a list to represent the number of times each letter appear in the word
elements=[]
number=[]
for i in word:
  if i in elements:
    k=elements.index(i)
    number[k]=number[k]+1
  else:
    elements.append(i)
    number.append(1)
print(elements)
## ['P', 'R', 'O', 'B', 'A', 'I', 'L', 'T', 'Y']
print(number)
## [1, 1, 1, 2, 1, 2, 1, 1, 1]
def fact(n):
  if(n<0):
    print("Invalid argument for factorial")
    return None
  elif (n==1):
    k=1
  else:
    k=n*fact(n-1)
  return(k)

fact(5)
## 120
fact(-1)
## Invalid argument for factorial
if elements==[]:
  print("Enter a Valid Word")
else:
  dino=1
for i in range(len(number)):
  dino=dino*fact(number[i])
NumberCases=fact(len(word))/dino
print("Number of Cases is",NumberCases)
## Number of Cases is 9979200.0
  1. Write a python program to count the number of occurrence of a letter in a string without using count() function
word='statistics'
word=word.lower()
LetterCheck='S'
LetterCheck=LetterCheck.lower()
count=0
for i in word:
  if (i==LetterCheck):
    count=count+1
print("The letter", LetterCheck, "appear in" , word,",", count, 'times')
## The letter s appear in statistics , 3 times

Alternatively we can use the count function.

word='statistics'
word=word.lower()
LetterCheck='S'
LetterCheck=LetterCheck.lower()
count=word.count(LetterCheck)
print("The letter", LetterCheck, "appear in" , word,",", count, 'times')
## The letter s appear in statistics , 3 times
  1. Write a program which will find all such numbers which are divisible by 7 but are not a multiple of 5,between 2000 and 3200 (both included).The numbers obtained should be printed in a comma-separated sequence on a single line.
#Range is denoted by a and b
a=2000
b=3000
#Divisible by c but by d
c=7
d=5
for i in range(a,b+1):
  if (i%c==0 and i%d!=0):
    print(i,end=',')
## 2002,2009,2016,2023,2037,2044,2051,2058,2072,2079,2086,2093,2107,2114,2121,2128,2142,2149,2156,2163,2177,2184,2191,2198,2212,2219,2226,2233,2247,2254,2261,2268,2282,2289,2296,2303,2317,2324,2331,2338,2352,2359,2366,2373,2387,2394,2401,2408,2422,2429,2436,2443,2457,2464,2471,2478,2492,2499,2506,2513,2527,2534,2541,2548,2562,2569,2576,2583,2597,2604,2611,2618,2632,2639,2646,2653,2667,2674,2681,2688,2702,2709,2716,2723,2737,2744,2751,2758,2772,2779,2786,2793,2807,2814,2821,2828,2842,2849,2856,2863,2877,2884,2891,2898,2912,2919,2926,2933,2947,2954,2961,2968,2982,2989,2996,

We can see that at the end of output there is an additional ‘,’, which is not preferred.

#Range is denoted by a and b
a=2000
b=3000
#Divisible by c but by d
c=7
d=5
out=[]
for i in range(a,b+1):
  if (i%c==0 and i%d!=0):
    out.append(i)
print(','.join(map(str, out)))
## 2002,2009,2016,2023,2037,2044,2051,2058,2072,2079,2086,2093,2107,2114,2121,2128,2142,2149,2156,2163,2177,2184,2191,2198,2212,2219,2226,2233,2247,2254,2261,2268,2282,2289,2296,2303,2317,2324,2331,2338,2352,2359,2366,2373,2387,2394,2401,2408,2422,2429,2436,2443,2457,2464,2471,2478,2492,2499,2506,2513,2527,2534,2541,2548,2562,2569,2576,2583,2597,2604,2611,2618,2632,2639,2646,2653,2667,2674,2681,2688,2702,2709,2716,2723,2737,2744,2751,2758,2772,2779,2786,2793,2807,2814,2821,2828,2842,2849,2856,2863,2877,2884,2891,2898,2912,2919,2926,2933,2947,2954,2961,2968,2982,2989,2996

In the program above, the join() function only works if all the items in the list are strings. However, in this case, all the contents of the list are integers. Therefore, we need to convert them to strings before applying the join() function. The map() function is used to apply the given function (in this case, str) to all the elements of an iterable, such as a list or tuple.

a=[5,7,8,3]
def trial(n):
  return(2*n+6)

result = list(map(trial, a))
print(result)
## [16, 20, 22, 12]
  1. Given a positive integer N(at least contain two digits). Write a Python program to add the first and last digits of the given number N.
#n=input("Enter the number")
n='6336563462542'
print(int(n[0])+int(n[-1]))
## 8

Treating the given number as integer as such

#n=input("Enter the number")
n=633656346254

last=n%10
a=n
while (a>0):
  first=a%10
  a=a//10
print(first+last)
## 10

  1. Given a number N. Write a Python program to print the remainder when the first digit of N is divided by its last digit.

  2. Write a Python program to print even length words in a string

str1="India is my country"
a=str1.split(" ")
print(a)
## ['India', 'is', 'my', 'country']
for i in range(len(a)):
  if (len(a[i])%2==0):
    print(a[i])
## is
## my
  1. Write a Python program to calculate the difference between the sum of digits in odd positions and the sum of digits in even positions in a given number.
import numpy as np
#n=eval(input("Enter the number: "))
n=123456
digits=[]
a=n
while (a>0):
  digits.append(a%10)
  a=a//10
print(digits)
## [6, 5, 4, 3, 2, 1]
SumOdd=0
SumEven=0
if (len(digits)%2==0):
  for i in range(1,len(digits),2):
    SumEven=SumEven+digits[i-1]
    SumOdd=SumOdd+digits[i]
else:
  for i in range(1,len(digits),2):
    SumEven=SumEven+digits[i]
    SumOdd=SumOdd+digits[i-1]
  SumOdd=SumOdd+digits[-1]
print(SumEven,"Even")
## 12 Even
print(SumOdd,"odd")
## 9 odd
print("Absolute difference between  between the sum of digits in odd positions and the sum of digits in even positions is",np.abs(SumEven-SumOdd) )
## Absolute difference between  between the sum of digits in odd positions and the sum of digits in even positions is 3
  1. Write a Python program to capitalize the first and last alphabet of each word in a string
str1='data :64542scientists are:565675 obliged to conduct their professional activities'
str1.lower()
## 'data :64542scientists are:565675 obliged to conduct their professional activities'
strList=str1.split(" ")
strList1=[]
for word in strList:
  j=0
  while (ord(word[j])<97 or ord(word[j])> 120):
    j=j+1
  k=-1
  while (ord(word[k])<97 or ord(word[k])> 120):
    k=k-1
  if (k==-1):
    word=word[:j]+word[j].upper()+word[(j+1):k]+word[k].upper()
  else:
    word=word[:j]+word[j].upper()+word[(j+1):k]+word[k].upper()+word[k+1:]
  strList1.append(word)
print(strList1)
## ['DatA', ':64542ScientistS', 'ArE:565675', 'ObligeD', 'TO', 'ConducT', 'TheiR', 'ProfessionaL', 'ActivitieS']
  1. Write a program, which will find all such numbers between any two numbers (both included) such that each digit of the number is an even number. The numbers obtained should be printed in a comma-separated sequence on a single line.
a=7000
b=9000
cond=[]
for i in range(a,b):
  num=str(i)
  for j in range(len(num)):
    if(int(num[j])%2 !=0):
      break
  else:
    cond.append(num)
if(len(cond)==0):
  print("There is no number satisfying condition in the given range")
else:
  print(",".join(cond))
## 8000,8002,8004,8006,8008,8020,8022,8024,8026,8028,8040,8042,8044,8046,8048,8060,8062,8064,8066,8068,8080,8082,8084,8086,8088,8200,8202,8204,8206,8208,8220,8222,8224,8226,8228,8240,8242,8244,8246,8248,8260,8262,8264,8266,8268,8280,8282,8284,8286,8288,8400,8402,8404,8406,8408,8420,8422,8424,8426,8428,8440,8442,8444,8446,8448,8460,8462,8464,8466,8468,8480,8482,8484,8486,8488,8600,8602,8604,8606,8608,8620,8622,8624,8626,8628,8640,8642,8644,8646,8648,8660,8662,8664,8666,8668,8680,8682,8684,8686,8688,8800,8802,8804,8806,8808,8820,8822,8824,8826,8828,8840,8842,8844,8846,8848,8860,8862,8864,8866,8868,8880,8882,8884,8886,8888
  1. Python program to print all prime numbers in an interval
a=35
b=47
if (b>=a and a>0):
  for j in range(a,b+1):
    for i in range(2,j//2+1):
      if (j%i==0):
        break
    else:
      print(j," is prime" )
else: 
  print("Invalid range")
## 37  is prime
## 41  is prime
## 43  is prime
## 47  is prime
  1. Write a Python program to find the HCF of three numbers, \(a,b\) and \(c\).
a=403
b=434
c=465
#As the first step we will evaluate the minimum of three numbers
minim=a
if (b<minim):
  minim=b
if(c<minim):
  minim=c
for i in range(minim,1,-1):
  if (a%i==0 and b%i==0 and c%i==0):
    print("HCF of the numbers {},{},{} is {}".format(a,b,c,i))
    break
## HCF of the numbers 403,434,465 is 31
  1. Write the Python program to find the HCF of all elements in a list
numbers=[55,75,60,80,965,95]
# first find the minimum of elements in the list
#print(min(numbers))

Alternatively we can find the maximum using the following code

minim=numbers[0]
for i in numbers:
  if(i<minim):
    minim=i
print("Minimum of the numbers in the list is", minim)
## Minimum of the numbers in the list is 55

Now let us write the Python program to find the HCF

for i in range(minim,0,-1):
  for j in numbers:
    if (j%i !=0):
      break
  else:
    hcf=i
    break
print("HCF of the numbers in the list is",hcf)
## HCF of the numbers in the list is 5
  1. Find the LCM of numbers in a list
numbers=[12,48,72,156]
#As first step we will find the maximum of the numbers in the list
maxim=numbers[0]
for i in numbers:
  if i>maxim:
    maxim=i
print("Maximum of the numbers in the list is", maxim)
## Maximum of the numbers in the list is 156

We can find maximum of the numbers using the max() function also. Now we shall find the LCM of these numbers

i=1
while (True):
  for j in numbers:
    if (maxim*i%j !=0):
      i=i+1
      break
  else: 
    lcm=j*i
    break
print("LCM of the numbers in the list is",lcm)
## LCM of the numbers in the list is 1872
  1. Write a python program to convert given sentence into camel case. For example ‘The difference of two exponential random variables with the same rate parameter follows a Laplace distribution.’ should be written as ‘TheDifferenceOfTwoExponentialRandomVariablesWithTheSameRateParameterFollowsALaplaceDistribution.’
string='The difference of two exponential random variables with the same rate parameter follows a Laplace distribution.'
word=string.lower().split(" ")
new=[]
for i in word:
  if (97<=ord(i[0])<=122):
    word1=i[0].upper()+i[1:]
    new.append(word1)
  else:
    print("Invalid character in ",i)
    break
else:
  camel=("").join(new)
  print(camel)
## TheDifferenceOfTwoExponentialRandomVariablesWithTheSameRateParameterFollowsALaplaceDistribution.
  1. Write a Python program to check whether given number is an Automorphic number. A number is called automorphic number if its square ends in same digits as the number itself. For example, 76 is an Automorphic number as square of 76, 5776, ends in 76.
N=24
sqr=N*N
N1=N
sqr1=sqr
while (N1>0):
  if (N1%10!=sqr1%10):
    print("Given number {} is not an Automorphic number".format(N))
    break
  else:
    N1=N1//10
    sqr1=sqr1//10
else:
  print("Given number {} is an Automorphic number".format(N))
## Given number 24 is not an Automorphic number
  1. Write a python program to check whether given two numbers are coprime. Co-prime numbers, also known as relatively prime numbers, are pairs of numbers that have no common factors other than 1. This means that their greatest common divisor (GCD) or highest common factor (HCF) is 1.
a=151
b=5
if (a<b):
  smaller=a
else: 
  smaller=b
for i in range(smaller,1,-1):
  if (a%i==0 and b%i==0):
    print("Numbers {} and {} are not co prime as {} is a factor of both numbers".format(a,b,i))
    break
else:
  print("Numbers {} and {} are co prime".format(a,b))
## Numbers 151 and 5 are co prime
  1. Write a Python program to test whether a given number is Pronic number. A number is said to be a pronic number if it can be expressed as product of two consecutive integers. Example- 90 is said to be a pronic number, 90=9×10, here 9 and 10 are consecutive integers.
import numpy as np
def pronicNumber(k):
  if (k>1):
    for i in range(int(np.sqrt(k))-1,int(np.sqrt(k))+1):
      if (i*(i+1)==k):
        print("The given number is a pronic number as we can write {}={} X {}".format(k,i,i+1))
        break
    else:
       print("The given number {} is NOT a pronic number".format(k))
pronicNumber(56)
## The given number is a pronic number as we can write 56=7 X 8
pronicNumber(60)
## The given number 60 is NOT a pronic number
pronicNumber(6)
## The given number is a pronic number as we can write 6=2 X 3
pronicNumber(2)
## The given number is a pronic number as we can write 2=1 X 2
  1. Write a Python function to check whether a given number is an ungly number. Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Examples of ugly numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15.
def isPrime(k):
  for i in range(2,int(k/2)+1):
    if(k%i==0):
      return False
      break
  else:
    return True
def uglyNumber(n):
  for i in range(2,int(n)+1):
    if n%i==0 and isPrime(i) and i not in [2,3,5]:
      print("The given number {} is not an ugly number because {} is a prime factor of it".format(n,i))
      break
  else:
     print("The given number {} is an ugly number".format(n))
uglyNumber(10)
## The given number 10 is an ugly number
uglyNumber(431)
## The given number 431 is not an ugly number because 431 is a prime factor of it