Python Assignment
Python Assignment
Div: E
Semester: 8th
Enrollment : 150200107065
Assignment 1
import math
import sys
def divSum(n) :
result = 0
if (n % index == 0) :
else :
return (result + 1)
def areAmicable(x, y) :
if (divSum(x) != y) :
150200107065 Page 1
return False
return (divSum(y) == x)
sys.exit()
number1 = int(sys.argv[1])
number2 = int(sys.argv[2])
if (areAmicable(number1,number2)) :
else :
OUTPUT
150200107065 Page 2
ASSIGNMENT 2
import sys
class Manager:
def __init__(self,accountNumber=0,BranchName=None,Balance=0):
self.accountNumber = accountNumber
self.BranchName = BranchName
self.Balance = Balance
def readFromFile(self,file):
list = []
f1 = open(file,'r')
Lines = f1.readlines()
f1.close()
object = Manager(int(row[0]),row[1],float(row[2]))
list.append(object)
return list
def getDataBranchWise(self,list,branchName):
totalAccounts = 0
totalBalance = 0.0
isBranchPresent = False
150200107065 Page 3
for object in list:
if(object.BranchName.lower() == branchName.lower()):
isBranchPresent = True
totalAccounts += 1
totalBalance += object.Balance
higheshBalance = object.Balance
lowestBalance = object.Balance
if(not isBranchPresent):
return
averageBalance = (totalBalance/totalAccounts)
print(output)
150200107065 Page 4
if(len(sys.argv) > 2 or len(sys.argv) < 2):
sys.exit()
p1 = Manager()
output = p1.readFromFile('accounts.txt')
p1.getDataBranchWise(output,sys.argv[1])
ACCOUNT.TXT
OUTPUT
150200107065 Page 5
150200107065 Page 6
ASSIGNMENT : 3
import sys
if len(sys.argv)==1:
print("Missing required input")
quit()
K = int(sys.argv[1])
listofnumbers1 = list()
for i in range(2,len(sys.argv)):
listofnumbers1.append(int(sys.argv[i]))
listofnumbers1.sort()
middle = int(len(listofnumbers1)/2)
median=0
if (len(listofnumbers1)%2)!=0:
#If total numbers are odd
median = listofnumbers1[middle]
else:
#If total numbers are even
median = ((listofnumbers1[middle]+listofnumbers1[middle-1])/2)
distancefromMedian = dict()
for num in listofnumbers1:
if num>median:
#Finding distance
distancefromMedian[num] = num-median
else:
#Finding distance
distancefromMedian[num] = median-num
sortedValues = sorted(distancefromMedian.values())
distancefromMedian1 = dict()
for i in range(0,len(sortedValues)):
for key in distancefromMedian:
#Matching sorted values with the keys and sorting the keys according to the distance
from median
if distancefromMedian[key]==sortedValues[i]:
distancefromMedian1[key] = sortedValues[i]
listofnumbers = list()
listofnumbers1.clear()
for key in distancefromMedian1:
#Storing sorted keys in the list
150200107065 Page 7
listofnumbers.append(key)
for i in range(0,K):
#Fetching first K numbers or fetching K numbers that are nearest to the median
listofnumbers1.append(listofnumbers[i])
listofnumbers1.sort()
print(listofnumbers1)
OUTPUT
150200107065 Page 8
ASSIGNMENT 4
import sys
import re
userString = (sys.argv[1])
if not re.match('^[a-zA-Z0-9]+$',userString):
sys.exit()
stringLength = len(userString)
number = ''
output = ''
list = []
currentInput = userString[item]
if currentInput.isalpha():
list.append(currentInput)
number = ''
else:
150200107065 Page 9
number += str(currentInput)
list.append(int(number))
if number != '':
list.append(int(number))
previousInput = ''
newList = []
newList.append(1)
newList.append(currentInput)
else:
newList.append(currentInput)
previousInput = currentInput
newList.append(1)
if isinstance(newList[item],str):
if (item+1) != len(newList):
print(output)
150200107065 Page 10
OUTPUT
150200107065 Page 11
ASSIGNMENT:5
import sys
list = []
for i in range(len(str)):
if i %k == 0:
lst = []
sub = str[i:i+k]
for j in sub:
lst.append(j)
list.append(''.join(lst))
return list
K = int(sys.argv[1])
userString = '*'.join(sys.argv[2:])
if(numberOfExtraCharacter != K):
output = function(userString,K)
150200107065 Page 12
string = ''
temp = ''
temp += item[index]
string += temp[::-1]
print(string)
OUTPUT
150200107065 Page 13