Python Practical Record Anna

CERTIFICATE
It is to be Certified that the ‘Practical Record’

submitted by Ms. Adya Sri class 12th – E for the
A.I.S.S.C.E. 2022-23 C.B.S.E. Board Practical
Examination in computer science, embodies the
original work done by the candidate. The candidate
carried out his work sincerely.
We have carefully gone through the contents of the

project & are fully satisfied with the work carried out
by him,
It is further certified that the candidate has completed

all the prescribed requirements governing the syllabus
of C.B.S.E. Sr. Sec Board.
Signature
Signature Mr. Gulshan Sharma
Dr. Urmila Vajpai
( PGT Computer Science )
( Principal )
1
Acknowledgement
In the 'odyssey' of 'life' the reverie to subjugate the

zenith of goal to many known & unknown hands
obtrude me learnt souls put me on right path &
enlightened with their knowledge & experience. I
shall ever remain grateful to them. Words are
inadequate to express my sincere & deepest sense
of gratitude to my guide & teacher Mr. Gulshan
Sharma for his benevolent guidance, constructive
counsel, & meticulous supervision, constant
inspirations & wholehearted encouragement
throughout the year.
2
At last I shall heartily thank to my
parents & for their love, care, concern & lots of
inspirations.
Adya Sri
Class : 12th –
E
Sacred Hearts Sr. Sec.
Public School
Table of Content
Sr. No. Topic

1 Function to calculate electricity bill on the bases of number of units
2 Creating a nested Dictionary and searching a value
3 Recursive function to computing sum of n natural numbers
4 Recursive function to computing sum of the square of n natural numbers
5 Recursive function to computing factorial of a number
6 Recursive function to computing m n
7 Recursive function to computing GCD of two given numbers
8 Recursive function to generating Fibonacci series for n number of terms
9 Recursive function to check a prime number
10 Recursive function to Display A String In Reverse Order
11 Recursive function to change case of a string i.e., in Toggle case
12 Recursive function to Computing Sum Of The Elements Of A List
13 Recursive function to find largest element of a List
3
14 Recursive function to search an element using Linear Search
15 Recursive function to search an element using Binary Search
16 Traversal in a Linear List – manipulation of elements
17 Traversal in a Linear List – displaying largest and smallest element of the List
18 Traversal in a Linear List – reversing the elements of a List
19 Traversal in a Linear List – swapping of the elements
20 Insertion in a Sorted Linear List
21 Deletion of a given element in a Linear List
22 Deletion of odd elements for a Linear List
23 Merging of two Linear Lists
24 Merging of two Linear List in reverse order
25 Sorting a Linear List using Bubble Sort
26 Sorting a Linear List using Selection Sort
27 Traversal in a Nested List – manipulation of elements
28 Traversal in a Nested List – sum of even elements of a nested List
29 Nested List – displaying elements of upper right triangle in a square matrix
30 Nested List – displaying elements of middle row and column of a square matrix
31 Nested List – displaying elements of both the diagonals in a square matrix
32 Nested List – displaying elements present on the boundary of a square matrix
33 Nested List – transpose of a square matrix
34 Implementing a Stack using a List
35 Implementing a Queue using a List
36 Text File – Writing and Reading data
37 Searching characters in a text file
38 Searching words in a text file
39 Searching lines in a text file
40 Modification in a text file
41 Deletion in a text file
42 Binary File – Writing and Reading data
43 Searching data in a binary file
44 Modifying data in a binary file
45 Searching of an element in a Linear List using Iteration – Linear Search
4
46 Searching of an element in a Linear List using Iteration – Binary Search
47 Problem of SQL – Queries
48 Line Chart
49 Bar Chart
50 Pie Chart
51 5 Problems of SQL – SQL Queries
52 Integrating MySQL with Python to write data in a table
53 Integrating MySQL with Python to display data from a table
54 Django based web server to parse a user request (POST), write data to CSV file.
5
PROGRAM 1 : Read number of units from user and calculate the electricity bill as follows–
Units Charges
<=100 500
>100 and <=200 2 per extra unit over 100
>200 and <=300 4 per extra unit over 200
>300 6 per extra unit over 300
def calculate(n):
if n <= 100 :
c = 500
elif n > 100 and n <= 200:
c = 500 + 2 * (n - 100)
elif n > 200 and n <= 300:
c = 500 + 2 * 100 + 4 * (n - 200)
else:
c = 500 + 2 * 100 + 4 * 100 + 6 * (n - 200)
return c
6
n = int (input("Enter Number of Units : "))
print("Electricity Bill : ", calculate(n))
Output of the Program :
Enter Number of Units : 320
Electricity Bill : 1820
PROGRAM 2 : Creating a nested Dictionary and searching a value
stu={}
per={}
n=int(input("Enter Number of Students : "))
for i in range(n):
r = int(input("Enter Roll Number : "))
n = input("Enter Name : ")
m = int(input("Enter Marks : "))
per['Name']=n
per['Marks']=m
stu[r]=dict(per)
print(stu)
ele = int(input("Enter roll no to be search : "))
for i in stu:
if ele == i:
print("Roll Number : ",i)
7
print("Name : ",stu[i]['Name'])
print("Marks : ",stu[i]['Marks'])
Enter Number of Students : 5

Enter Roll Number : 1
Enter Name : Raj
Enter Marks : 44
Enter Name : Deepak
Enter Marks : 22
Enter Name : Sumit
Enter Marks : 77
Enter Name : Mukesh
Enter Marks : 88
Enter Name : Rohit
Enter Marks : 77
{1: {'Name': 'Raj', 'Marks': 44}, 2: {'Name': 'Deepak', 'Marks': 22}, 3: {'Name': 'Sumit',
'Marks': 77}, 4: {'Name': 'Mukesh', 'Marks': 88}, 5: {'Name': 'Rohit', 'Marks': 77}}
Enter roll no to be search : 4
Roll Number : 4
Name : Mukesh
Marks : 88
PROGRAM 3 : Recursive function to computing sum of n natural numbers
def show(n):
if n<=1:
return n
else:
return n + show(n-1)
n = int(input("Enter Limit : " ))

print("Sum of the Number : ", show(n))
8
Enter Limit : 100
Sum of the Number : 5050
PROGRAM 4 : Recursive function to computing sum of the square of n natural numbers
def abc(n):
if n==1:
return 1
else:
return n * n + abc(n-1)
n = int(input("Enter a Number : "))
s = abc(n)
print(s)
Enter a Number : 5
55
PROGRAM 5 : Recursive function to computing factorial of a number
def abc(n):
if n==1:
return 1
else:
return n * abc(n-1)
n = int(input("Enter a Number : "))

s = abc(n)
print("Factorial is : ", s)
9
Enter a Number : 5
Factorial is : 120
PROGRAM 6 : Recursive function to computing m n
def abc(m,n):
if n==1:
return m
else:
return m * abc(m,n-1)
m = int(input("Enter Value of m : "))
n = int(input("Enter Value of n : "))
s = abc(m, n)
print("m to the Power n is : ", s)
Enter Value of m : 2
Enter Value of n : 5
m to the Power n is : 32
PROGRAM 7 : Recursive function to computing GCD of two given numbers
def abc(a, b):

if b <= 0:
return a
else:
return abc(b, a%b)
a = int(input("Enter a Number : "))

b = int(input("Enter another Number : "))
print("GCD : ", abc(a, b))
10
Enter a Number : 78
Enter another Number : 24
GCD : 6
PROGRAM 8 : Recursive function to generating Fibonacci series for n number of terms
def abc(n):
if n<=1:
return n
else:
return abc(n-1) + abc(n-2)
n = int(input("Enter limit : "))

print("Fibonacci Series : ", end = ' ')
for i in range(n):
print(abc(i), end = ', ')
Enter limit : 8
Fibonacci Series : 0, 1, 1, 2, 3, 5, 8, 13,
PROGRAM 9 : Recursive function to check a prime number
def abc(n ,i , x):

if i == n//2+1:
return x
else:
if n%i==0:
x+=1
return abc(n, i+1, x)
n = int(input("Enter a no : "))
if abc(n,1,0) == 1:
print("Prime no")
11
else:
print("Not Prime")
Enter a no : 17
Prime no
PROGRAM 10 : Recursive function to Display A String In Reverse Order
def abc(a,s):
if s == len(a):
return
else:
abc(a,s+1)
print(a[s], end=' ')
a = input("Enter a String : ")

s = len(a)
print("Reversed String : ", end = ' ')
abc(a,0)
Enter a String : PYTHON
Reversed String : N O H T Y P
PROGRAM 11 : Recursive function to change case of a string i.e., in Toggle case
def abc(a, s, b):

if s == len(a):
return b
else:
if a[s].isupper():
b = b + a[s].lower()
elif a[s].islower():
b = b + a[s].upper()
else:
b = b + a[s]
12
return abc(a, s+1, b)
a = input("Enter a String : ")

b = ''
print("Modified String : ", abc(a,0,b))
Enter a String : This Car Is Red
Modified String : tHIS cAR iS rED
PROGRAM 12 : Recursive function to Computing Sum Of The Elements Of A List
def abc(a, n):

if n<0:
return 0
else:
return a[n] + abc(a, n-1)
a = eval(input("Enter a List : "))

print(abc(a,len(a)-1))
Enter a List : [1,2,3,4,5,6]
21
PROGRAM 13 : Recursive function to find largest element of a List
def abc(a, i, maxa):

if i == -1:
return maxa
elif a[i] > maxa :
maxa = a[i]
return abc(a, i-1, maxa)
a = eval(input("Enter a list : "))

p = abc(a, len(a)-1, a[0])
13
print("Largest element = ",p)
Enter a list : [5,1,8,2,77,2,87,23]
Largest element = 87
PROGRAM 14 : Recursive function to search an element using Linear Search
def abc(a, i, ele):

if i == -1:
return -1
elif ele == a[i]:
return i
else:
return abc(a,i-1, ele)
a = eval(input("Enter a list : "))

ele = int(input("Enter element to be search : "))
p = abc(a, len(a)-1, ele)
if p == -1:
print("element not found")
else:
print("found at ",p+1)
enter a list : [5,2,8,3,9,5,2,4]
enter element to be search : 8
found at 3
PROGRAM 15 : Recursive function to search an element using Binary Search
def abc(a , ele , b , l):

if b > l:
return -1
m = (b + l)//2
if ele == a[m]:
return m
elif ele > a[m]:
return abc(a, ele, m+1, l)
14
else:
return abc(a, ele, b, m-1)
a = eval(input("Enter elements of a list in Ascending order : "))

p = abc(a, ele, 0 , len(a)-1)
if p == -1:
print("Element not found")
else:
print("Element found at : ", p+1)
Enter elements of a list in Ascending order : [10,20,30,40,50,60,70,80]
Enter element to be search : 60
Element found at : 6
PROGRAM 16 : Traversal in a Linear List – manipulation of elements by dividing even

elements by 2 and multiplying other elements by 3
def show(a):
for i in range(len(a)):
if a[i] % 2 == 0:
a[i] = a[i] // 2
else:
a[i] = a[i] * 3
print("List after Modification : ", a)
#----------Main------------------
a = []
s = int(input("Enter Size of a List : "))
print("Enter element of the List")
for i in range(s):
a.append(int(input("Enter an element : ")))
print("Original List : ", a)
show(a)
15
Enter Size of a List : 5
Enter element of the List
Enter an element : 11
Original List : [11, 22, 33, 44, 55]
List after Modification : [33, 11, 99, 22, 165]
PROGRAM 17 : Traversal in a Linear List – displaying largest and smallest element of the
List
def show(a):
mx = mn = a[0]
for i in range(1, len(a)):
if a[i] > mx:
16
mx = a[i]
elif a[i] < mn:
mn = a[i]
print("Largest element is : " , mx)
print("Smallest element is : " , mn)
#----------Main------------------
a = []
for i in range(s):
show(a)

Original List : [44, 11, 77, 44, 99, 22]

Largest element is : 99
Smallest element is : 11
PROGRAM 18 : Traversal in a Linear List – reversing the elements of a List
def show(a):
for i in range(len(a)//2):
a[i], a[len(a)-1-i] = a[len(a)-1-i], a[i]
print("Reversed list is : " , a)
#----------Main------------------
a = []
17
for i in range(s):
show(a)

Original List : [1, 2, 3, 4, 5, 6]

Reversed list is : [6, 5, 4, 3, 2, 1]
PROGRAM 19 : Traversal in a Linear List – swapping of first half elements with next half
elements of a list
def show(a):
for i in range(len(a)//2):
a[i], a[len(a)//2+i] = a[len(a)//2+i], a[i]
print("Reversed list is : " , a)
#----------Main------------------
18
a = []
for i in range(s):
show(a)

Original List : [1, 2, 3, 4, 5, 6]

Reversed list is : [4, 5, 6, 1, 2, 3]
PROGRAM 20 : Insertion in a Sorted Linear List
def Insertion(a, ele):

p = -1
if ele < a[i]:
p = i
19
break
if p == -1 :
a.append(ele)
else:
a.insert(p,ele)
print("List after Insertion : ", a)
#----------Main------------------
a = []
for i in range(s):
ele = int(input("Enter element to be inserted : "))
Insertion(a, ele)

Enter element to be inserted : 25
Original List : [10, 20, 30, 40, 50, 60, 70]

List after Insertion : [10, 20, 25, 30, 40, 50, 60, 70]
PROGRAM 21 : Deletion of a given element in a Linear List
def Deletion(a, ele):

p = -1 #default position in case element not present
if ele == a[i]:
20
p = i
break
a.pop(p)
print("List after Deletion : ", a)
#----------Main------------------
a = []
for i in range(s):
ele = int(input("Enter element to be deleted : "))
Deletion(a, ele)

Enter element to be deleted : 30
Original List : [10, 80, 30, 20, 90, 60, 50]

List after Deletion : [10, 80, 20, 90, 60, 50]
PROGRAM 22 : Deletion of odd elements for a Linear List
def Deletion(a):
i = 0
while i <= len(a)-1:
21
if a[i]%2 == 0:
a.pop(i)
i+=1
print("List after Deletion : ", a)
#----------Main------------------
a = []
for i in range(s):
Deletion(a)

Original List : [1, 2, 3, 4, 5]
List after Deletion : [1, 3, 5]
PROGRAM 23 : Merging of two Linear Lists
def Merging(a, b):

c = a + b
print("First List : ", a)
22
print("Second List : ", b)
print("Merged List : ", c)
#----------Main------------------
a = []
b = []
s = int(input("Enter Size of first List : "))
print("Enter element of First List")
for i in range(s):
s = int(input("Enter Size of Second List : "))
print("Enter element of Second List")
for i in range(s):
b.append(int(input("Enter an element : ")))
Merging(a, b)
Enter Size of first List : 3

Enter element of First List
Enter Size of Second List : 4

Enter element of Second List
First List : [55, 22, 44]

Second List : [99, 66, 88, 77]
Merged List : [55, 22, 44, 99, 66, 88, 77]
PROGRAM 24 : Merging of two Linear List in reverse order
def Merging(a, b):

a.reverse()
b.reverse()
23
c = a +b
print("First List : ", a)
print("Second List : ", b)
print("Merged List : ", c)
#----------Main------------------
a = []
b = []
s = int(input("Enter Size of first List : "))
print("Enter element of First List")
for i in range(s):
s = int(input("Enter Size of Second List : "))
print("Enter element of Second List")
for i in range(s):
b.append(int(input("Enter an element : ")))
Merging(a, b)
Enter Size of first List : 3

Enter element of First List
Enter Size of Second List : 4

Enter element of Second List
First List : [3, 2, 1]

Second List : [6, 7, 8, 9]
Merged List : [3, 2, 1, 6, 7, 8, 9]
PROGRAM 25 : Sorting a Linear List using Bubble Sort
def BubbleSort(a):
24
for j in range(len(a)-1-i):
if a[j]>a[j+1]:
a[j] , a[j+1] = a[j+1] , a[j]
print(a)
#----------Main------------------
a = []
for i in range(s):
BubbleSort("Sorted List is : ", a)

Sorted List is : [1, 2, 4, 5, 8]
PROGRAM 26 : Sorting a Linear List using Selection Sort
def SelectionSort(a):
small = a[i]
25
p = i
for j in range(i+1, len(a)):
if a[j] < small:
small = a[j]
p = j
a[i], a[p] = a[p], a[i]
print("Sorted List is : ", a)

#----------Main------------------
a = []
for i in range(s):
SelectionSort(a)

Sorted List is : [11, 12, 22, 25, 64]
PROGRAM 27 : Traversal in a Nested List – manipulation of elements
def show(A, R, C):
26
for i in range(R):
for j in range(C):
if A[i][j] % 2 == 0:
A[i][j] = A[i][j] // 2
else:
A[i][j] = A[i][j] * 3
print("Modified List is : ")

for i in range(R):
for j in range(C):
print(A[i][j], end = ' ')
print()
A = []
R = int(input("Enter No of Rows : "))
C = int(input("Enter No of Columns : "))
for i in range(R):
B = []
for j in range(C):
n=int(input("Enter an element : "))
B.append(n)
A.append(B)
print("Original List is : ")

for i in range(R):
for j in range(C):
print()
show(A, R, C)
27
Enter No of Rows : 3
Enter No of Columns : 3
Original List is :
123
456
789
Modified List is :
319
2 15 3
21 4 27
PROGRAM 28 : Traversal in a Nested List – sum of even elements of a nested List
28
def show(A, R, C):
s = 0
for i in range(R):
for j in range(C):
if A[i][j] % 2 == 0:
s = s + A[i][j]
print("Sum of Even Elements : ", s)
A = []
for i in range(R):
B = []
for j in range(C):
B.append(n)
A.append(B)

for i in range(R):
for j in range(C):
print()
show(A, R, C)
29
Original List is :
123
456
789
Sum of Even Elements : 20
30
PROGRAM 29 : Nested List – displaying elements of upper right triangle in a square matrix
def show(A, R, C):

for i in range(R):
for j in range(C):
if i <= j:
else :
print(' ', end = ' ')
print()
A = []
for i in range(R):
B = []
for j in range(C):
B.append(n)
A.append(B)

for i in range(R):
for j in range(C):
print()
print("Upper Right Triangle of List : ")
show(A, R, C)
31
Original List is :
123
456
789
Upper Right Triangle of List :

123
56
9
32
PROGRAM 30 : Nested List – displaying elements of middle row and column of a square
matrix
def show(A, R, C):

for i in range(R):
for j in range(C):
if i == R//2 or j == C//2:
else :
print(' ', end = ' ')
print()
A = []
for i in range(R):
B = []
for j in range(C):
B.append(n)
A.append(B)

for i in range(R):
for j in range(C):
print()
print("Middle Row and Column of List : ")
show(A, R, C)
33
Original List is :
123
456
789
Middle Row and Column of List :

2
456
8
34
PROGRAM 31 : Nested List – displaying elements of both the diagonals in a square matrix
def show(A, R, C):

for i in range(R):
for j in range(C):
if i == j or i + j == C-1:
else :
print(' ', end = ' ')
print()
A = []
for i in range(R):
B = []
for j in range(C):
B.append(n)
A.append(B)

for i in range(R):
for j in range(C):
print()
print("Both the Diagonals of List : ")
show(A, R, C)
35
Original List is :
123
456
789
Both the Diagonals of List :

1 3
5
7 9
36
PROGRAM 32 : Nested List – displaying elements present on the boundary of a square
matrix
def show(A, R, C):

for i in range(R):
for j in range(C):
if i == 0 or i == R-1 or j == 0 or j == C-1:
else :
print(' ', end = ' ')
print()
A = []
for i in range(R):
B = []
for j in range(C):
B.append(n)
A.append(B)

for i in range(R):
for j in range(C):
print()
print("Boundary elements of List : ")
show(A, R, C)
37
Original List is :
123
456
789
Boundary elements of List :

123
4 6
789
38
PROGRAM 33 : Nested List – transpose of a square matrix
def show(A, R, C):

for i in range(R):
for j in range(C):
if i <= j:
A[i][j], A[j][i] = A[j][i], A[i][j]
for i in range(R):
for j in range(C):
print()
A = []
for i in range(R):
B = []
for j in range(C):
B.append(n)
A.append(B)

for i in range(R):
for j in range(C):
print()
print("Transpose of List : ")
show(A, R, C)
39
Original List is :
123
456
789
Transpose of List :
147
258
369
40
PROGRAM 34 : Implementing a Stack using a List
def Push(a):
ele = int(input("Enter an element to be inserted in Stack : "))
a.append(ele)
def Pop(a):
if a == []:
print("Underflow")
else:
print("Popped element is : ", a.pop())
def Peek(a):
if a == []:
print("Underflow")
else:
print("element at the top : ", a[len(a)-1])
def Display(a):
if a == []:
print("Underflow")
else:
for i in range(len(a)-1,-1,-1):
print(a[i])
#-------------------------------
MAIN----------------------------------
a = []
top = None
while True:
print("Stack Operatons")
print("1. Push")
print("2. Pop")
print("3. Peek")
print("4. Display")
print("5. Exit")
ch = int(input("Enter Choice : "))
if ch == 1:
Push(a)
41
elif ch == 2:
Pop(a)
elif ch == 3:
Peek(a)
elif ch == 4:
Display(a)
elif ch == 5:
break
Stack Operatons Stack Operatons

1. Push 1. Push
2. Pop 2. Pop
3. Peek 3. Peek
4. Display 4. Display
5. Exit 5. Exit
Enter Choice : 1 Enter Choice : 2

Popped element is : 88
Enter an element to be inserted in Stack : 66 Stack Operatons
Stack Operatons 1. Push
1. Push 2. Pop
2. Pop 3. Peek
3. Peek 4. Display
4. Display 5. Exit
5. Exit
Enter Choice : 4
Enter Choice : 1 33
66
Enter an element to be inserted in Stack : 33 Stack Operatons
Stack Operatons 1. Push
1. Push 2. Pop
2. Pop 3. Peek
3. Peek 4. Display
4. Display 5. Exit
5. Exit
Enter Choice : 3
Enter Choice : 1 element at the top : 33
Stack Operatons
Enter an element to be inserted in Stack : 88 1. Push
Stack Operatons 2. Pop
1. Push 3. Peek
2. Pop 4. Display
3. Peek 5. Exit
4. Display
5. Exit Enter Choice : 5
42
Enter Choice : 4
88
33
66
PROGRAM 35 : Implementing a Queue using a List
def Enqueue(a):
ele = int(input("Enter an element to be inserted in Queue : "))
a.append(ele)
def Dequeue(a):
if a == []:
print("Underflow")
else:
print("Deleted element is : ", a.pop(0))
def Peek(a):
if a == []:
print("Underflow")
else:
print("element at the Front : ", a[0])
def Display(a):
if a == []:
print("Underflow")
else:
print(a[i], end = " , ")
#-------------------------
MAIN---------------------------------------
a = []
while True:
print("\n1Queue Operatons")
print("1. Insert")
print("2. Delete")
print("3. Peek")
print("4. Display")
print("5. Exit")
ch = int(input("Enter Choice : "))
if ch == 1:
Enqueue(a)
43
elif ch == 2:
Dequeue(a)
elif ch == 3:
Peek(a)
elif ch == 4:
Display(a)
elif ch == 5:
break
Queue Operatons Enter Choice : 4

1. Insert 55 , 33 , 99 ,
2. Delete Queue Operatons
3. Peek 1. Insert
4. Display 2. Delete
5. Exit 3. Peek
4. Display
Enter Choice : 1 5. Exit
Enter an element to be inserted in Queue : 55 Enter Choice : 2

Deleted element is : 55
Queue Operatons
1. Insert Queue Operatons
2. Delete 1. Insert
3. Peek 2. Delete
4. Display 3. Peek
5. Exit 4. Display
5. Exit
Enter Choice : 1
Enter Choice : 4
Enter an element to be inserted in Queue : 33 33 , 99 ,
Queue Operatons
Queue Operatons 1. Insert
1. Insert 2. Delete
2. Delete 3. Peek
3. Peek 4. Display
4. Display 5. Exit
5. Exit
Enter Choice : 3
Enter Choice : 1 element at the Front : 33
Enter an element to be inserted in Queue : 99 Queue Operatons

1. Insert
44
Queue Operatons 2. Delete
1. Insert 3. Peek
2. Delete 4. Display
3. Peek 5. Exit
4. Display
5. Exit Enter Choice : 5
PROGRAM 36 : Text File – Writing and Reading data
File = open("record.txt", "w")

for i in range(4):
n = input("Enter a Line : ")
n = n + '\n'
File.write(n)
File.close()
print("Data writing is successful")
print(“Data Present in File”)

file = open("record.txt", "r")
data = file.read()
print(data)
file.close()
45
Enter a Line : This is First line
Enter a Line : This is Second line
Enter a Line : This is Third line
Enter a Line : This is Forth line
Data writing is successful
Data Present in File
This is First line

This is Second line
This is Third line
This is Forth line
PROGRAM 37 : Searching characters in a text file
def abc():
file=open('data.txt','r')
content =file.read()
print(content)
x=y=z=0
for i in content:
if i.isupper():
x+=1
if i.islower():
y+=1
else:
z+=1
print ("No. of Upper Case Characters are : ", x)
print ("No. of Lower Case Characters are : ", y)
print ("No. of OtherCharacters are : ", z)
file.close()
abc()
46
This is First line

This is Second line
This is Third line
This is Forth line
No. of Upper Case Characters are : 8

No. of Lower Case Characters are : 53
No. of OtherCharacters are : 23
PROGRAM 38 : Searching words in a text file
def abc():
x = 0
data=file.readlines()
for line in data:
print(line)
word = line.split()
for i in word:
if i == 'is':
x+=1
file.close()
print("is counted : ", x)
abc()
47
This is First line

This is Second line
This is Third line
This is Forth line
is counted : 4
PROGRAM 39 : Searching lines in a text file – display the line which contains ‘Second’ as
sub-string.
def abc():
data=file.readlines()
for line in data:
if 'Second' in line:
print(line)
file.close()
abc()
This is Second line
PROGRAM 40 : Modification in a text file – display the character ‘T’ as ‘C’
48
def abc():
print(content)
print()
for i in content:
if i == 'T':
print('C', end = '')
else:
print(i, end = '')
file.close()
abc()
This is First line

This is Second line
This is Third line
This is Forth line
Chis is First line

Chis is Second line
Chis is Chird line
Chis is Forth line
PROGRAM 41 : Deletion in a text file – delete the word ‘This’
def abc():
word = content.split()
b = ''
for i in word:
if i != 'This':
b = b +' '+ i
file.close()
file=open('data.txt','w')
file.write(b)
file.close()
print(content)
49
file.close()
abc()
is First line is Second line is Third line is Forth line
PROGRAM 42 : Binary File – Writing and Reading data of a dictionary having names of
three students.
import pickle
def writing():
n = {1:'ram',2:'mohan', 3:'shyam'}
file = open('bylist.dat', 'wb')
pickle.dump(n,file)
print("Data added successfully")
file.close()
def reading():
file = open('bylist.dat', 'rb')
n = pickle.load(file)
print(n)
file.close()
50
writing()
reading()
Data added successfully
{1: 'ram', 2: 'mohan', 3: 'shyam'}
PROGRAM 43 : Searching data in a binary file. Writing data of student in the form of
dictionary and displaying records of those students who are having marks greater than 90.
import pickle
def writing():
s = int(input("Enter Number of Students : "))
file = open('bylist.dat', 'wb')
d ={}
for i in range(s):
r = int(input("Enter Roll No : "))
n = input("Enter Name :")
m = int(input("Enter Marks : "))
d['rollno']=r
d['name']=n
51
d['marks']=m
pickle.dump(d,file)
print("Data added successfully")
file.close()
def reading():
try:
while True:
d = pickle.load(file)
if d['marks']>90:
print(d)
except EOFError :
file.close()
writing()
reading()
52
Enter Number of Students : 3
Enter Roll No : 1
Enter Name :Raj
Enter Marks : 95
Enter Roll No : 2
Enter Name :Dinesh
Enter Marks : 34
Enter Roll No : 3
Enter Name :Ravi
Enter Marks : 93
Data added successfully
{'rollno': 1, 'name': 'Raj', 'marks': 95}
{'rollno': 3, 'name': 'Ravi', 'marks': 93}
PROGRAM 44 : Modifying data in a binary file
53
import pickle
def modification():
try:
while True:
d = pickle.load(file)
if d['marks']>90:
d['marks'] = 100
print(d)
except EOFError :
file.close()
modification()
{'rollno': 1, 'name': 'Raj', 'marks': 100}
{'rollno': 3, 'name': 'Ravi', 'marks': 100}
54
PROGRAM 45 : Searching of an element in a Linear List using Linear Search method using
iteration.
def LinearSearch(a, ele):

p = -1
if ele == a[i]:
p = i
break
if p == -1:
else:
print("Element Found at : ", p+1)
#----------Main------------------
a = []
for i in range(s):
LinearSearch(a, ele)


Element Found at : 5
55
PROGRAM 46 : Searching of an element in a Linear List using Binary Search method using
iteration.
def BinarySearch(a, ele):
p = -1
b = 0
l = len(a)-1
while b<=l:
m = (b + l)//2
if ele == a[m]:
p = m
break
elif ele > a[m]:
b = m+1
else:
l = m-1
if p == -1:
else:
print("Element Found at : ", p+1)
#----------Main------------------
a = []
print("Enter element of the List in Ascending Order ")
for i in range(s):
BinarySearch(a, ele)
56
Enter element of the List in Ascending Order

Element Found at : 6
PROGRAM 47 : Line Chart
import matplotlib.pyplot as pl
import numpy as np
x = np.linspace(0, 10, 1000)
pl.plot(x, np.sin(x), color = 'green', linewidth = 4, linestyle =
'dotted')
pl.plot(x, np.cos(x), color = 'red', linewidth = 4, linestyle =
'dashed')
pl.title("Line Chart")
pl.xlabel("Natural Numbers")
pl.ylabel("Sin / Cos Values")
pl.show()
57
PROGRAM 48 : Bar chart
import numpy as np
R = np.array([1, 2, 3, 4])
T1 = [ 45, 80, 25, 95 ]
T2 = [ 75, 92, 58, 65 ]
pl.bar(R, T1, color = 'red', width = 0.3)
pl.bar(R+0.3, T2, color = 'green', width = 0.3)
pl.xticks(R,['James', 'Alice', 'Raj', 'Sumit'])
pl.title("Report Card")
pl.xlabel("Name of Students")
pl.ylabel("Marks")
pl.show()
58
PROGRAM 49 : Pie Chart
M = [55, 10, 26, 74]
N = ['Atul', 'James', 'Sanjeev', 'Anurag']
C = ['pink', 'red', 'yellow', 'cyan']
E = [0, 0.3, 0, 0]
pl.pie( M, labels = N, colors = C, explode = E, autopct = "%1.1f%
%" )
pl.show()
59
60
61
Consider the following tables and write SQL commands for the given statements
1) Table : PRODUCT
P_ID ProductName Manufacturer Price
TP01 Talcom Powder LAK 40
FW05 Face Wash ABC 45
BS01 Bath Soap ABC 55
SH06 Shampoo XYZ 120
FW12 Face Wash XYZ 95
Table : CLIENT
C_ID ClientName City P_ID
01 Cosmetic Shop Delhi FW05
06 Total Health Mumbai BS01
12 Live Life Delhi SH06
12 Pretty Woman Delhi FW12
16 Dreams Banglore TP01
1) To display the details of those Clients whose City is Delhi.
62
2) To display the details of products whose Price is in the range of 50 to 100 ( Both values included ).
3) To display the ClientName, City from table CLIENT and ProductName and Price from table
PRODUCT, with their corresponding matching P_ID.
4) To increase the price of all Products by 10 which are having Manufacturer ABC.
5) Give outputs:
a. select Count ( distinct City ) from Client;
b. select Manufacturer, MAX (Price) from Product Group By Manufacturer;
c. select ClientName, Manufacturer from Client, Product where Client . P_ID = Product . P_ID;
d. select ProductName, Price * 4 from Product;
Answers
1) Select * from CLIENT where City = ‘Delhi’;

2) Select * from PRODUCT where Price between 50 and 100;
3) Select ClientName, City, ProductName, Price from CLIENT A , PRODUCT B where A . P_ID
= B . P_ID;
4) Update PRODUCT set Price = Price + 10 where Manufacturer = ‘ABC’ ;
a. Count ( Distinct City)
3
b. Manufacturer Max ( Price )
LAK 40
ABC 55
XYZ 120
c. ClientName Manufacturer
Cosmatic Shop ABC
Total Health ABC
Live Life XYZ
Pretty Woman XYZ
Dreams LAK
d. ProductName Price * 4
Talcom Powder 160
Face Wash 180
Bath Soap 220
Shampoo 480
Face Wash 380
2) Table : Emp
Empid Firstname Lastname Address City
010 Ravi Kumar Raj nagar GZB
152 Sam Tones 33 Elm St. Paris
215 Sarah Ackerman 440 U.S. 110 Upton
244 Manila Sengupta 24 Friends street New Delhi
300 Robert Samuel 9 Fifth Cross Washington
335 Ritu Tondon Shastri Nagar GZB
400 Rachel Lee 121 Harrison St. New York
Sal
Empid Salary Benefits Designation
010 75000 15000 Manager
152 80000 25000 Director
215 75000 12500 Manager
244 50000 12000 Clerk
300 45000 10000 Clerk
335 40000 10000 Clerk
63
400 32000 7500 Salesman
(i) To show firstname, address and city of all employees living in Paris
(ii) To display the content of Employees table having empid > 200 in descending order of Firstname.
(iii) To display the firstname and total salary of all managers from the tables Emp and sal , where total
salary is calculated as salary+benefits.
(iv) To display the maximum salary among managers and clerks from the table sal.
(v) Give the Output of following SQL commands:
(i) Select count(distinct designation) from sal;
(ii) Select designation, Count(*) from sal group by designation having count(*) >2;
(iii) Select sum(benefits) from sal where designation =’Clerk’;
(iv) Select distinct City from Emp;
Answers
a) Select Firstname, Address from Emp where City = ‘Paris’;

b) Select * from Emp where Empid > 200 Order By Firstname Desc;
c) Select Firstname, Salary + Benefits “Total Salary” from Emp A, Sal B Where A . Empid = B .
Empid and Designation = ‘Manager’;
d) Select Max ( Salary ) from Sal where Designation In (‘Manager’ , ‘Clerk’);
I. Count(distinct designation)
4
II. Designation Count(*)

Clerk 3
III. Sum ( Benefits )

32000
IV. Distinct city

GZB
Paris
Upton
New Delhi
Washington
New York
3) Table : ITEM
I_ID ItemName Manufacturer Price
PC01 Personal Computer ABC 35000
LC05 Laptop ABC 55000
PC03 Personal Computer XYZ 32000
PC06 Personal Computer COMP 37000
LC03 Laptop PQR 57000
Table : CUSTOMER
C_ID CustomerName City I_ID
01 N Roy Delhi LC03
06 H Singh Mumbai PC03
12 R Pandey Delhi PC06
15 C Sharma Delhi LC03
16 K Agarwal Banglore PC01
a) To display the details of those customers whose city is Delhi.

b) To display the details of Item whose Price is in the range of 35000 to 55000 (Both values included).
64
c) To display CustomerName, City, ItemName and Price of those items whose price is more than 50000.
d) To increase the Price of all items by 1000 in the table Item.
e) Give output of the following commands:
i) Select Count(Distinct City) From Customer;
ii) Select ItemName, Max(Price)) From Item Group By ItemName;
iii) Select CustomerName, Manufacturer From Item, Customer
Where Item . I_ID = Customer . I_I_D;
iv) Select ItemName, Price * 100 From Item Where Manufacturer = ‘ABC’;
Answers
1) Select * from CUSTOMER where City = ‘Delhi’;
2) Select * from ITEM where Price between 35000 and 55000;
3) Select CustomerName, City, ItemName, Price from CUSTOMER A , ITEM B where A .

I_ID = B . I_ID;
4) Update ITEM set Price = Price + 10 ;
e. Count ( Distinct City)

3
f. ItemName Max ( Price )
ABC 55000
XYZ 32000
COMP 37000
PQR 57000
g. CustomerName Manufacturer
N Roy PQR
H Singh XYZ
R Pandey COMP
C Sharma PQR
K Agarwal ABC
h. ItemName Price * 10
Personal Computer 350000
Laptop 550000
4) Table : Doctor
ID Name Dept Sex Experience
101 John ENT M 12
104 Smith ORTHOPEDIC M 5
107 George CARDIOLOGY M 10
114 Lara SKIN F 3
109 K George MEDICINE F 9
117 Lucy ENT F 3
Table : Salary
ID Basic Allowance Consultation
101 12000 1000 300
104 23000 2300 500
107 32000 4000 500
114 12000 5200 100
109 42000 1700 200
65
a) Display Name of all doctors who are in ‘MEDICINE’ having more than 10 years experience.
b) Display the Salary of all doctors working in ‘ENT’ department, where Salary = Basic + Allowance.
c) Display the minimum Allowance of female doctors.
d) Increase the Basic Salary of the doctors by 10% whose consultation fees is greater than 200.
e) Give output :
i) Select Count(*) from Doctor where sex = ‘F’;
ii) Select Name, Basic From Doctor, Sal Where Dept = ‘ENT’ And Doctor.ID = Salary.ID;
iii) Select Distinct Dept from Doctor where Sex = ‘M’;
iv) Select Sum(Consultation) from Doctor, Sal where Doctor.ID = Salary.ID and Experience >= 10;
Answers
a) Select Name from Doctor where Dept = ‘MEDICINE’ and Experience > 10;
b) Select Basic + Allowance “ Salary “ from Doctor A , Sal B where A . ID = B . ID and Dept = ‘ENT’;
c) Select Min ( Allowance ) from Doctor A, Sal B Where A . ID = B . ID and Sex = ‘F’;
c) Update Sal set Basic = Basic + 0.1 * Basic where Consultation > 200 ;
i. Count( * )
3
ii. Designation Basic

John 12000
iii. Min ( Allowance )

1700
iv. Sum ( Consultation )

800
5) Table : Voter
VoterID Name Area City Sex Age

101 Ravi Sanjay Nagar Bareilly M 45
102 Seema Ram Nagar Delhi F 35
103 Alex Central Point Delhi M 25
104 Nitin Pawan Bihar Bareilly M 42
105 Sudha Avadh Avas Mumbai F 55
106 Pushpa Civil Lines Delhi F 33
107 Ali Old City Bareilly M 40
a) To display the information of Voters who live in Delhi and having age in between 30 and 50.
b) Create a view “VIP” having information of male Voters who belong to Area “Civil Lines”.
c) Display Name and Age of male Voters whose name starts with ‘A’ in the descending order of there
Age and alphabetical order of their Name.
d) Display average Age of the male Voters of each city.
66
e) Assign the value of age as 18 to those Voters whose age is NULL.
f) Insert a new row in the table Voter with following values ( 108 , ‘Neha’ , ‘Old City’ , ‘Bareilly’ , ‘F’ ,
36).
Answers
a) Select * from Voter where City = ‘Delhi’ and Age Between 30 and 50;
b) Create View VIP as Select * from Voter where Area = ‘Civil Lines’ and Sex = ‘M’;
c) Select Name , Age from Voter where Sex = ‘F’ and Name Like ‘A%’ Order By Age Desc, Name ;
d) Select Avg ( Age ) from Voter Group By City Having Sex = ‘M’ ;
e) Update Voter Set Age = 18 Where Age Is Null;
f) Insert Into Voter Values ( 108 , ‘Neha’ , ‘Old City’ , ‘Bareilly’ , ‘F’ , 36);
Integrating MySQL with Python to write data in a table student (id, name, marks)
import mysql.connector as ms
conobj = ms.connect(host = “localhost”, user = “root”, passwd = “
” , database = “test”)
if conobj.is_connected() == False:
print(“Connection of MySQL database failed”)
cursor = conob.cursor( )
st = “insert into student(id, name, marks) values(501, ‘Sumit’, 78)”
67
cursor.execute(st)
conobj.commit( )
data = conobj.fetchall( )
for i in data :
print( i )
conobj.close( )
Integrating MySQL with Python to display data from a table student who are having marks
above 90.
import mysql.connector as ms
conobj = ms.connect(host = “localhost”, user = “root”, passwd = “
” , database = “test”)
if conobj.is_connected() == False:
print(“Connection of MySQL database failed”)
cursor = conob.cursor( )
st = “insert into student(id, name, marks) values(501, ‘Sumit’, 78)”
cursor.execute(st)
conobj.commit( )
data = conobj.fetchall( )
for i in data :
print( i )
conobj.close( )
Django Based Web Application
Creating Views : create views for the Apps –
def abc ( request ) :

return render ( request , ‘INFO.HTML’)
Creating URL Confs : The process of linking URLs and displaying actual templates is called
as URL routing.
 Open urls.py file for defining URL configurations
 Import views .py file of the Apps as : from student import views
 Define the path as : path ( ‘first/’ , views.abc )
68
from django.contrib import admin
from django.urls import views
from student import views
urlpatterns = [
path( ‘admin/’ , admin.site.urls ),
path ( ‘first/’ , views.abc ),
]
Write a view function “show” that can process a GET request and display “hello.html” as
template.
from django.shortcuts import render

def show ( request ) :
return render ( request , ‘HELLO.HTML’)
Django based web server to parse a user request (POST), and write it to a CSV file.
A view function “inputdata” that can process a POST request and write POST data in a CSV
file “data.csv”. The data contains the records of students in a Python dictionary.
from django.shortcuts import render

import csv
def inputdata ( request ) :
if request.method == POST:
D = request.POST
with open ( ‘data.csv’ , ‘a’ ) as file:
w = csv.writer (file)
for k , v in D.items( ):
w.writerow( [k , v])
return render ( request , ‘INFO.HTML’)
69

Python Practical Record Anna

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Python Practical Record Anna

Uploaded by

Copyright:

Available Formats

CERTIFICATE

It is to be Certified that the ‘Practical Record’

We have carefully gone through the contents of the

It is further certified that the candidate has completed

In the 'odyssey' of 'life' the reverie to subjugate the

Sr. No. Topic

Output of the Program :

Enter Number of Units : 320

Electricity Bill : 1820

PROGRAM 2 : Creating a nested Dictionary and searching a value

Output of the Program :

Enter Number of Students : 5

Enter roll no to be search : 4

PROGRAM 3 : Recursive function to computing sum of n natural numbers

n = int(input("Enter Limit : " ))

Output of the Program :

Sum of the Number : 5050

PROGRAM 4 : Recursive function to computing sum of the square of n natural numbers

Output of the Program :

PROGRAM 5 : Recursive function to computing factorial of a number

n = int(input("Enter a Number : "))

Output of the Program :

PROGRAM 6 : Recursive function to computing m n

Output of the Program :

PROGRAM 7 : Recursive function to computing GCD of two given numbers

def abc(a, b):

a = int(input("Enter a Number : "))

Output of the Program :

Enter another Number : 24

PROGRAM 8 : Recursive function to generating Fibonacci series for n number of terms

n = int(input("Enter limit : "))

Output of the Program :

Fibonacci Series : 0, 1, 1, 2, 3, 5, 8, 13,

PROGRAM 9 : Recursive function to check a prime number

def abc(n ,i , x):

Output of the Program :

PROGRAM 10 : Recursive function to Display A String In Reverse Order

a = input("Enter a String : ")

Output of the Program :

Enter a String : PYTHON

PROGRAM 11 : Recursive function to change case of a string i.e., in Toggle case

def abc(a, s, b):

a = input("Enter a String : ")

Output of the Program :

Enter a String : This Car Is Red

Modified String : tHIS cAR iS rED

PROGRAM 12 : Recursive function to Computing Sum Of The Elements Of A List

def abc(a, n):

a = eval(input("Enter a List : "))

Output of the Program :

Enter a List : [1,2,3,4,5,6]

PROGRAM 13 : Recursive function to find largest element of a List

def abc(a, i, maxa):

a = eval(input("Enter a list : "))

Output of the Program :

Enter a list : [5,1,8,2,77,2,87,23]

PROGRAM 14 : Recursive function to search an element using Linear Search

def abc(a, i, ele):

a = eval(input("Enter a list : "))

Output of the Program :

enter a list : [5,2,8,3,9,5,2,4]

enter element to be search : 8

PROGRAM 15 : Recursive function to search an element using Binary Search

def abc(a , ele , b , l):