DR.

AMBEDKAR INSTITUTE OF TECHNOLOGY FOR HANDICAPPED

KANPUR
SESSION : 2021-22

NAME : AJAY GUPTA

ROLL NO : 1901660100006

SUBJECT : PYTHON LANGUAGE PROGRAMMING LAB

(KCS453)

GUIDED BY: SUBMITTED BY :

VISHNAVI SHUKLA AJAY GUPTA

 INDEX

1.To write a python program exponentiation

(power of a number).

2. To write a python program find the

maximum of a list of numbers.

3. To write a python program linear search.

4. To write a python program Binary search.

5. To write a python program selection sort.

6. To write a python program Insertion sort.

7. To write a python program merge sort.

8. To write a python program first n prime

numbers.
 EXPERIMENT NO. 1

To write a python program exponentiation

(power of a number).

Program :
a=int (input ("enter the values of base_a:"))

b=int (input ("\n enter the values of power_b:"))

print("the value of a raise the power b is:")

print(a**b)
 EXPERIMENT NO. 2

To write a python program find the maximum of a

list of numbers.

Program :

list1=[12,34,54,32,34,36,31]

print("maximum no from the list is:")

print(max(list1))
 EXPERIMENT NO. 3

To write a python program linear search.

Program :

def search(arr, n, x):

for i in range(0, n):

if (arr[i] == x):

return i

return -1

arr = [5, 14, 25, 30, 56]

x = 30

n = len(arr)

result = search(arr, n, x)

if(result == -1):

print("Element is not present in array")

else:

print("Element is present at index", result)

 EXPERIMENT NO. 4

To write a python program Binary search.

Program : def binarySearch (arr, l, r, x):

if r >= l:

mid = l + (r - l) // 2

if arr[mid] == x:

return mid

elif arr[mid] > x:

return binarySearch(arr, l, mid-1,

else:

return binarySearch(arr, mid + 1, r, x)

else:

# Element is not present in the array

return -1

arr = [ 5, 13, 24, 36, 50]

x = 36

result = binarySearch(arr, 0, len(arr)-1, x)

if result != -1:

print ("Element is present at index % d" % result)

else:

print ("Element is not present in array")

 EXPERIMENT NO. 5

To write a python program selection sort.

Program :

A = [53, 27, 15, 23, 10]

for i in range(len(A)):

min_idx = i

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

if A[min_idx] > A[j]:

min_idx = j

A[i], A[min_idx] = A[min_idx], A[i

print ("Sorted array")

for i in range(len(A)):

print("%d" %A[i]),
 EXPERIMENT NO. 6

To write a python program insertion sort.

Program :
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)

for i in range(len(arr)):

print ("% d" % arr[i])

 EXPERIMENT NO. 7
To write a python program merge sort.

Program :
def mergeSort(arr):

if len(arr) > 1:

mid = len(arr)//2

R = arr[mid:]

mergeSort(L)

mergeSort(R)

i=j=k=0

while i < len(L) and j < len(R):

if L[i] < R[j]:

arr[k] = L[i]

i += 1

else:

arr[k] = R[j]

j += 1

k += 1
# Checking if any element was left

while i < len(L):

arr[k] = L[i]

i += 1

k += 1

while j < len(R):

arr[k] = R[j]

j += 1

k += 1

def printList(arr):

for i in range(len(arr)):

print(arr[i], end=" ")

print()

if __name__ == '__main__':

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

print("Given array is", end="\n")

printList(arr)

mergeSort(arr)

print("Sorted array is: ", end="\n")

printList(arr)
 EXPERIMENT NO. 8

To write a python program first n prime

numbers.

Program :

n=int(input("enter a number till you want to print)

for i in range(n):

if i>1:

for j in range(2,i):

if(i % j==0):

break

else:

print(i)