Solutions

Author: jayacred

1_div5not7.py

@@ -0,0 +1,7 @@
+'''program in python to print the sum of numbers 
+that are divisible by 5 and not divisible by 7'''
+sum = 0
+for i in range(1, 500):   #specify max-range of 500
+     if (i % 5 == 0 and i % 7 != 0): #initial condition
+         sum = sum + i
+print sum

2_surface_area.py

@@ -0,0 +1,16 @@
+l=8
+b=8
+h=10
+def tsr1(l,b,h):
+     area=2*((l*b)+(l*h)+(h*b))
+     print("The area before increase in 15% of room's dimensions is : ",area)
+
+def tsr2(l,b,h):
+        l=8+0.15
+        b=8+0.15
+        h=10+0.15
+        area=2*((l*b)+(l*h)+(h*b))
+        print("The area after increase in 15% of room's dimensions is : ",area)
+
+tsr1(l,b,h)
+tsr2(l,b,h)

3_ListSort_concat.py

@@ -0,0 +1,11 @@
+list1 = ['Ron', 'Hermoine', 'Harry', 'Professor','Potter','Dobby','Granger','Lockhart','Weasly']
+list2=['Potter','Gred','Greg','George','Voldemort','Sirius','Dumbledore']
+list1.sort();
+list2.sort();
+print("The sorted list1 is : ",list1)
+print("The sorted list2 is : ",list2)
+
+concatlist=list(set(list1+list2))
+print("List after concatenation : ",concatlist)
+concatlist.sort();
+print("list after sorting the concatenated list : ",concatlist)

5_one_twenty.py

@@ -0,0 +1,19 @@
+primeNo = [2,3,5,7,11,13,17,19]
+sno = 1
+
+#def Primefac(n): returns the list of prime factors of 'n'
+def Primefac(n):
+        pfac = []
+        for j in primeNo:
+                if i % j == 0:
+                        pfac.append(j)
+
+        return pfac
+
+#multiplies all the prime factors of all the numbers 
+#from 1[1..20]
+for i in range(1,20+1):
+        primelst = Primefac(i)
+        for i in primelst:
+                sno *= i 
+print ('smallest number divisible by [1..20] without remainder ',sno)

6_prime.py

@@ -0,0 +1,10 @@
+max=int(input("enter max. no. upto which you want find prime numbers : " ))
+for i in range(2,max+1):
+    prime=True
+    for j in range(2,i):
+        if i%j==0:
+            prime=False
+    if prime:
+        print(i)
+
+

7_palindrome.py

@@ -0,0 +1,15 @@
+'''Program to check for a palindrome string'''
+
+def isPalindrome(str):
+        rev=str[::-1]
+        print("String : ",str)
+        print("reverse : ",rev)
+        if(str==rev):
+            return True
+        else:
+            return False
+x=input("enter a string : ")
+if isPalindrome(x):
+    print("It is a Palindrome Number")
+else:
+    print("It is not a palindrome number")