import numpy as np
print("\nVersion of Numpy is ",np.__version__)
x = np.arange(25, 50).reshape(5,5)
print("\n Matrix representation in Numpy\n",x)
Solve Problems by Coding Solutions - A Complete solution for python programming
Different Set Operations
A = {1,2,3,4,5,6,7,8};
B = {5,10,15,20,25,30,35,40};
print("Union of A and B is",A | B)
print("\nIntersection of A and B is",A & B)
print("\nDifference of A and B is",A - B)
print("\nSymmetric difference of A and B is",A ^ B)
B = {5,10,15,20,25,30,35,40};
print("Union of A and B is",A | B)
print("\nIntersection of A and B is",A & B)
print("\nDifference of A and B is",A - B)
print("\nSymmetric difference of A and B is",A ^ B)
Use pass for an empty block
#Credits to NPTEL MOOC, Programming, Data Structures & Algorithms in #Python by Madhavan Mukund, Chennai Mathematical Institute
while(True):
try:
userdata = input("Enter a number: ")
usernum = int(userdata)
except ValueError:
print("Not a number. Try again")
except NameError:
pass
else:
break
Check wheather a number is composite or not
#Credits to NPTEL MOOC, Programming, Data Structures & Algorithms in #Python by Madhavan Mukund, Chennai Mathematical Institute
def composite(n): for i in range(2,n): if n%i == 0: return(True) return(False)
Divison with multiple conditions
#Credits to NPTEL MOOC, Programming, Data Structures & Algorithms in #Python by Madhavan Mukund, Chennai Mathematical Institute
def divides(m,n):
if n%m == 0:
return(True)
else:
return(False)
def even(n):
return(divides(2,n))
def odd(n):
return(not divides(2,n))
GCD using euclids algorithms & looping
# Credits to NPTEL MOOC,Programming, Data Structures & Algorithms
#in Python by Madhavan Mukund, Chennai Mathematical Institute
def gcd(m,n):
if m < n: # Assume m >= n
(m,n) = (n,m)
while (m%n) != 0:
diff = m-n
# diff > n? Possible!
(m,n) = (max(n,diff),min(n,diff))
return(n)
#in Python by Madhavan Mukund, Chennai Mathematical Institute
def gcd(m,n):
if m < n: # Assume m >= n
(m,n) = (n,m)
while (m%n) != 0:
diff = m-n
# diff > n? Possible!
(m,n) = (max(n,diff),min(n,diff))
return(n)
Greatest common divisor program using euclids algorithms
#Credits to NPTEL MOOC, Programming, Data Structures & Algorithms in #Python by Madhavan Mukund, Chennai Mathematical Institute
def gcd(m,n):
if m < n:
(m,n) = (n,m)
if (m%n) == 0:
return(n)
else:
diff = m-n
return(gcd(max(n,diff),min(n,diff)))
print(gcd(12,3))
Greatest common divisor program with looping
#Credits to NPTEL MOOC, Programming, Data Structures & Algorithms in #Python by Madhavan Mukund, Chennai Mathematical Institute
def gcd(m,n):
i = min(m,n)
while i > 0:
if (m%i) == 0 and (n%i) == 0:
return(i)
else:
i = i-1
Greatest common divisor program without list Implementation
#Credits to NPTEL MOOC, Programming, Data Structures & Algorithms in #Python by Madhavan Mukund, Chennai Mathematical Institute
def gcd(m,n):
for i in range(1,min(m,n)+1):
if (m%i) == 0 and (n%i) == 0:
mrcf = i
return(mrcf)
Greatest common divisor program - A shorter Implementation
#Credits to NPTEL MOOC, Programming, Data Structures & Algorithms #in
Python by Madhavan Mukund, Chennai Mathematical Institute
def gcd(m,n):
cf = []
for i in range(1,min(m,n)+1):
if (m%i) == 0 and (n%i) == 0:
cf.append(i)
return(cf[-1])
def gcd(m,n):
cf = []
for i in range(1,min(m,n)+1):
if (m%i) == 0 and (n%i) == 0:
cf.append(i)
return(cf[-1])
Subscribe to:
Posts (Atom)