ClassicPythonExercises/Basic_programs.py at main · gurungsuresh13/ClassicPythonExercises · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
""""

#Factorial Program
f=1
a=int(input("Enter a number: "))
if a<0:
    print("No factorial")
elif a==0:
    print("Factorial is 1")
else:
    for i in range(1,a+1):
         f=f*i
    print("The factorial of a number is ",f)

"""

""""
#Fibonnaci Series
first=0
second=1
print(first)
print(second)
for i in range(2,10):
    next=first+second
    first=second
    second=next
    print(next)
"""

"""
#Swapping two numbers
a=int(input("Enter 1st number:"))
b=int(input("Enter 2nd number:"))
c=a
a=b
b=c
print("The swapped numbers are",a,b)
"""

"""
#Reversal of a string
string="How tremendous the agony of unmade decisions"
b=string.split()
b=b[-1::-1]
outputstring=" ".join(b)
print(outputstring)
"""

"""
#Prime Number
x = int(input("Enter a number:"))
for i in range(2, x):
    if x % i == 0:
        print("Not a prime")
        break
else:
    print("A prime")
"""

"""
#Armstrong Number
number = int(input("Enter a number:"))
sum=0
order=len(str(number))
a=number
while number>0:
 digit = number % 10
 sum += digit ** order
 number = number // 10
if (sum==a):
  print("Armstrong number")
else:
 print("Not Armstrong number")
 """

"""
#Call By
def tech(string):
 string = "Greatlearning"
 print("Inside", string)
string = "GL"
tech(string)
print("Outside", string)

def tech(set):
 set.add(56)
 print("Inside",set)
set1 = {43,57,88}
tech(set1)
print("Outside", set1)
"""

"""
#Second largest number
list1=[1,2,3,4,5,9,6,11]
list1.sort()
print(list1[-2])
"""

"""
#Palindrome number
number = int(input("Enter a number:"))
reverse = 0
a=number
while (number>0):
 digit=number%10
 reverse=reverse*10+digit
 number=number//10
if(reverse==a):
   print("Palindrome number")
else:
    print("Not Palindrome number")
"""

"""
#Pattern
no_of_rows = 5
for i in range(no_of_rows):
 for j in range(i):
  print(i, end=' ')
 print('')
"""

"""
#Pascal triangle
no_of_rows = 5
x=no_of_rows
for i in range(x):
 print(' '*(x-i), end='')
 print(' '.join(map(str, str(11**i))))
"""

"""
#Matrix Multiplication
import numpy as np
a = ([1, 4, 5],[6 ,5, 4],[7, 6, 5])
b = ([9, 2, 8],[3, 2, 1],[1,13, 7])
c = np.dot(a,b)
print(c)
"""