PYTHON LAB

0905CS191008
Abhishek kumar
CS-506
CSE-A(B1)
Experiment-2

1) WAP in python to perform selection sort algorithm.

Source Code:-

def selectionSort( itemsList ):

n = len( itemsList )
for i in range( n - 1 ):
minValueIndex = i

for j in range( i + 1, n ):
if itemsList[j] < itemsList[minValueIndex] :
minValueIndex = j

if minValueIndex != i :
temp = itemsList[i]
itemsList[i] = itemsList[minValueIndex]
itemsList[minValueIndex] = temp

return itemsList

el = [21,6,9,33,3]

print(selectionSort(el))

Output:-
 2) WAP in python to perform insertion sort Algorithm.

Source Code:-

def insertionSort(arr):

for i in range(1, len(arr)):

key = arr[i]

j = i-1
while j >=0 and key < arr[j] :
arr[j+1] = arr[j]
j -= 1
arr[j+1] = key

arr = [12, 11, 13, 5, 6]

insertionSort(arr)
print ("Sorted array is:")
for i in range(len(arr)):
print ("%d" %arr[i])

Output:-
 3) WAP in python to perform merge sort algorithm.

Source Code:-

def merge(arr, l, m, r):

n1 = m - l + 1
n2 = r - m

# create temp arrays

L = [0] * (n1)
R = [0] * (n2)

for i in range(0, n1):

L[i] = arr[l + i]

for j in range(0, n2):

R[j] = arr[m + 1 + j]

i = 0
j = 0
k = l

while i < n1 and j < n2:

if L[i] <= R[j]:
arr[k] = L[i]
i += 1
else:
arr[k] = R[j]
j += 1
k += 1

while i < n1:

arr[k] = L[i]
i += 1
k += 1

while j < n2:

arr[k] = R[j]
j += 1
k += 1

def mergeSort(arr, l, r):

if l < r:

m = l+(r-l)//2
 mergeSort(arr, l, m)
mergeSort(arr, m+1, r)
merge(arr, l, m, r)

arr = [12, 11, 13, 5, 6, 7]

n = len(arr)
print("Given array is")
for i in range(n):
print("%d" % arr[i]),

mergeSort(arr, 0, n-1)
print("\n\nSorted array is")
for i in range(n):
print("%d" % arr[i]),

Output:-
 4) WAP to find First N Prime Numbers.

Source Code:-

numr=int(input("Enter range:"))

print("Prime numbers:",end=' ')

for n in range(1,numr):

for i in range(2,n):

if(n%i==0):

break

else:

print(n,end=' ')

Output:-
 5) WAP to find Multiplication of Two Matrices.

Source Code:-

A = [[12, 7, 3],
[4, 5, 6],
[7, 8, 9]]

B = [[5, 8, 1, 2],
[6, 7, 3, 0],
[4, 5, 9, 1]]

result = [[0, 0, 0, 0],

[0, 0, 0, 0],
[0, 0, 0, 0]]

for i in range(len(A)):

for j in range(len(B[0])):

for k in range(len(B)):
result[i][j] += A[i][k] * B[k][j]

for r in result:
print(r)

Output:-
 6) WAP in python to take input as Command Line Arguments.

Source Code:-

import sys

n = len(sys.argv)
print("Total arguments passed:", n)

print("\nName of Python script:", sys.argv[0])

print("\nArguments passed:", end = " ")

for i in range(1, n):
print(sys.argv[i], end = " ")

Sum = 0
for i in range(1, n):
Sum += int(sys.argv[i])

print("\n\nResult:", Sum)

Output:-
 7) WAP in Python to read a file and find Most Frequent word from file.

Source Code:-

file = open("gfg.txt","r")
frequent_word = ""
frequency = 0
words = []

for line in file:

line_word = line.lower().replace(',','').replace('.','').split(" ");

for w in line_word:
words.append(w);

for i in range(0, len(words)):

count = 1;

for j in range(i+1, len(words)):

if(words[i] == words[j]):
count = count + 1;

if(count > frequency):

frequency = count;
frequent_word = words[i];

print("Most repeated word: " + frequent_word)

print("Frequency: " + str(frequency))
file.close();
Output:-