SESSION 2022-2023

CBSE (CENTRAL BOARD OF

SECONDARY EDUCATION)
COMPUTERS PROJECT FILE
TOPIC: - PYTHON PROGRAMMES
SUBMITTED BY: - SUBMITTED
TO: - ABDUL AHAD
ASHWANI SIR
CLASS: 12th SC.A

1
INDEX:
1. PROGRAM TO SORT A LIST USING BUBBLE SORT. 4

2. PROGRAM TO SORT A LIST USING INSERTION SORT. 6

3. IMPLEMENTATION OF A 2-D LIST (SUM OF ALL ELEMENTS 8
OF A MATRIX OF ORDER M x N).
4. PROGRAM TO CREATE A TEXT FILE. 10

5. PROGRAM TO COUNT NUMBER OF LINES PRESENT IN A 11

TEXT FILE.
6. PROGRAM TO COUNT NUMBER OF LINES STARTING WITH 12
UPPERCASE LETTER IN A TEXT FILE.
7. PROGRAM TO COUNT NUMBER OF LOWERCASE AND 13
UPPERCASE LETTERS IN A TEXT FILE.
8. PROGRAM TO COUNT NUMBER OF WORDS STARTING 15
WITH LOWERCASE VOWEL.
9. PROGRAM TO CREATE A BINARY FILE BY WRITING 16
PRODUCT NUMBER, NAME AND PRICE.
10. PROGRAM TO COPY DETAILS OF ALL PRODUCTS HAVING 18
PRICED MORE THAN 100 ON ANOTHER FILE.
11. PROGRAM TO COUNT NUMBER OF PRODUCTS HAVING 20
PRICED MORE THAN 100.
12. PROGRAM TO SEARCH ANY PRODUCT IN BINARY FILE 21
WITH THE HELP OF PRODUCT NUMBER.
13. PROGRAM TO UPDATE THE PRICE OF A PRODUCT USING 22
ITS PRODUCT NUMBER.

14. PROGRAM TO CREATE A CSV FILE WITH STUDENT ROLL 23

NUMBER, NAME AND MARKS ON IT.
15. PROGRAM TO COUNT NUMBER OF RECORDS IN A CSV 25

2
FIL HAVING MARKS MOR THAN 90.
16. PROGRAM TO SEARCH THE LOCATION OF AN ELEMENT 26
USING LINEAR SEARCH.
17. PROGRAM TO SEARCH THE LOCATION OF AN ELEMENT 28
USING BINARY SEARCH.
18. IMPLEMENTATION OF STACK. 30

3
1. PROGRAM TO SORT A LIST USING BUBBLE SORT.

CODE:
# WAP TO SORT A LIST USING BUBBLE SORT (ABDUL AHAD)

alist=[]

n=int(input("Enter number of elements"))

for i in range(n):

x=int(input("Enter elements"))

alist.append(x)

print("List is",alist)

for i in range(len(alist)):

for j in range(len(alist)-i-1):

if alist[j]>alist[j+1]:

alist[j],alist[j+1]=alist[j+1],alist[j]

print("List after sorting:",alist)

4
OUTPUT:

5
2. PROGRAM TO SORT A LIST USING INSERTION
SORT.

CODE:
# WAP TO SORT A LIST USING INSERTION SORT (ABDUL AHAD)

alist=[]

n=int(input("Enter number of elements to be entered in list:"))

for i in range(n):

x=int(input("Enter elements of the list"))

alist.append(x)

print("List created:",alist)

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

key=alist[i]

j=i-1

while j>=0 and key<alist[j]:

alist[j+1]=alist[j]

j=j-1

else:

alist[j+1]=key

print("List after sorting",alist)

6
OUTPUT:

7
3. IMPLEMENTATION OF A 2-D LIST (SUM OF ALL
ELEMENTS OF A MATRIX OF ORDER MxN).

CODE:
# IMPLEMENTATION OF A 2-D LIST

#(SUM OF ALL ELEMENTS OF A MATRIX OF ORDER MxN)(ABDUL

AHAD)

a=0

L=[]

m=int(input("Enter number of rows"))

n=int(input("Enter number of columns"))

for i in range(m):

b=[]

for j in range(n):

x=int(input("Enter Elements"))

b.append(x)

L.append(b)

print("Elements of list are")

for i in range(m):

print(" ")

for j in range(n):

a=a+L[i][j]

print(L[i][j],end=" ")

8
print(" ")

print("Sum of all elements:",a)

OUTPUT:

9
4. PROGRAM TO CREATE A TEXT FILE.

CODE:
# WAP TO CRATE A TEXT FILE (ABDUL AHAD)

F=open("LINES.txt",'w')

ch='y'

while ch=='y':

x=input("Enter data")

F.write(x)

ch=input("Enter y to write more data:")

F.close()

F1=open("LINES.txt",'r')

c=F1.read()

print("Contets from file",c)

F1.close()

10
OUTPUT:

5. PROGRAM TO COUNT NUMBER OF LINES

PRESENT IN A TEXT FILE.

CODE:
# WAP TO COUNT NUMBER OF LINES PRESENT IN A TEXT FILE
(ABDUL AHAD)

F=open("LINES.txt",'r')

x=F.readlines()

y=len(x)

print("No. of lines present in file:",y)

F.close()

OUTPUT:

11
6. PROGRAM TO COUNT NUMBER OF LINES
STARTING WITH UPPERCASE LETTER IN A TEXT
FILE.
CODE:
# WAP TO COUNT NUMBER OF LINES STARTING WITH UPPERCASE
LETTER IN A TEXT FILE (ABDUL AHAD)

F = open("LINES.txt",'r')

c=0

ch = F.readline()

while ch:

if ch[0].isupper():

c=c+1

ch = F.readline()

print("Number of lines starting with uppercase letter are",c)

F.close()

12
OUTPUT:

7. PROGRAM TO COUNT NUMBER OF LOWERCASE

AND UPPERCASE LETTERS IN A TEXT FILE.

CODE:
# WAP TO COUNT NUMBER OF LOWERCASE AND UPPERCASE
LETTERS IN A TEXT FILE (ABDUL AHAD)

c1=0

c2=0

F=open("LINES.txt",'r')

x=F.read()

y=x.split()

for i in y:

for j in i:

if j.isupper():

c1=c1+1

elif j.islower():

13
 c2=c2+1

print("Number of uppercase letters",c1)

print("Number of lowercase letters",c2)

F.close()

OUTPUT:

14
8. PROGRAM TO COUNT NUMBER OF WORDS
STARTING WITH LOWERCASE VOWEL.

CODE:
# WAP TO COUNT NUMBER OF WORDS STARTING WITH
LOWERCASE VOWEL (ABDUL AHAD)

F=open("LINES.txt",'r')

c=0

ch=F.read()

s=ch.split()

for a in s:

if a[0] in ['a','e','i','o','u']:

c=c+1

print("Number of words starting with lowercase vowels are",c)

F.close()

15
OUTPUT:

9. PROGRAM TO CREATE A BINARY FILE BY

WRITING PRODUCT NUMBER, NAME AND PRICE.

CODE:
# WAP TO CREATE A BINARY FILE BY WRITING PRODUCT
NUMBER,NAME AND PRICE (ABDUL AHAD)

import pickle

F=open("STOCK.dat",'wb')

ch='y'

while ch=='y':

d={}

P=int(input("Enter product number"))

N=input("Name of product")

MRP=float(input("Enter price"))

d["Product number"]=P

d["Name"]=N

16
 d["Price"]=MRP

pickle.dump(d,F)

ch=input("Enter Y/N to enter more data:")

F.close()

F=open("STOCK.dat",'rb')

try:

while True:

x=pickle.load(F)

print(x)

except EOFError:

F.close()

17
OUTPUT:

10. PROGRAM TO COPY DETAILS OF ALL PRODUCTS

HAVING PRICED MORE THAN 100 ON ANOTHER
FILE.

CODE:

18
# WAP TO COPY DETAILS OF ALL PRODUCTS HAVING PRICE MORE
THAN 100 ON ANOTHER FILE (ABDUL AHAD)

import pickle

F1=open("STOCK.dat",'rb')

F2=open("COPY.dat",'wb')

try:

print("Data in file")

while True:

x=pickle.load(F1)

print(x)

if x['Price']>100:

pickle.dump(x,F2)

except EOFError:

F1.close()

F2.close()

F3=open("COPY.dat",'rb')

try:

print("Products with price more than 100")

while True:

y=pickle.load(F3)

print(y)

except EOFError:

19
 F3.close()

OUTPUT:

11. PROGRAM TO COUNT NUMBER OF PRODUCTS

HAVING PRICED MORE THAN 100.

CODE:

20
#WAP TO COUNT NUMBER OF PRODUCTS HAVING PRICE MORE
THAN 100 (ABDUL AHAD)

import pickle

c=0

F=open("STOCK.dat",'rb')

try:

while True:

x=pickle.load(F)

if x['Price']>100:

c=c+1

except EOFError:

print("Products with price greater than 100 are",c)

F.close()

OUTPUT:

12. PROGRAM TO SEARCH ANY PRODUCT IN BINARY

FILE WITH THE HELP OF PRODUCT NUMBER.

CODE:

21
# WAP TO SEARCH ANY PRODUCT IN BINARY FILE WITH THE
HELP OF PRODUCT NUMBER (ABDUL AHAD)

import pickle

F=open("STOCK.dat",'rb')

y=int(input("Enter product number that you want to search"))

try:

while True:

x=pickle.load(F)

if x['Product number']==y:

print(x)

except EOFError:

F.close()

OUTPUT:

13. PROGRAM TO UPDATE THE PRICE OF A

PRODUCT USING ITS PRODUCT NUMBER.

CODE:

22
# WAP TO UPDATE THE PRICE OF A PRODUCT USING ITS PRODUCT
NUMBER (ABDUL AHAD)

import pickle

F=open("STOCK.dat",'rb+')

x=int(input("Enter product number to change the price"))

y=float(input("Enter new price"))

try:

print("File after update")

while True:

c=pickle.load(F)

if c['Product number']==x:

c['Price']=y

print(c)

except EOFError:

F.close()

OUTPUT:

23
14. PROGRAM TO CREATE A CSV FILE WITH
STUDENT ROLL NUMBER, NAME AND MARKS ON IT.

CODE:
# WAP TO CREATE A CSV FILE WITH STUDENT ROLL
NUMBER,NAME AND MARKS ON IT (ABDUL AHAD)

import csv

F=open("STUDENT RECORDS.csv",'w')

w=csv.writer(F)

w.writerow(['Roll number','Name','Marks'])

N=int(input("Enter no. of records:"))

for i in range(N):

R=int(input("Enter Roll no.:"))

NM=input("Enter name:")

M=float(input("Enter marks:"))

S=[R,NM,M]

w.writerow(S)

F.close()

with open("STUDENT RECORDS.csv",'r',newline='\r\n') as F:

r=csv.reader(F)

for x in r:

print(x)

24
OUTPUT:

25
15. PROGRAM TO COUNT NUMBER OF RECORDS IN
A CSV FILE HAVING MARKS MORE THAN 90.

CODE:
# WAP TO COUNT NUMBER OF RECORDS IN A CSV FILE HAVING
MARKS MORE THAN 90 (ABDUL AHAD)

import csv

c=0

with open("STUDENT RECORDS.csv",'r', newline = '\r\n') as F:

r=csv.reader(F)

for i in r:

if i[2] != "Marks":

if float(i[2]) > 90:

c=c+1

print(i)

else:

pass

print("Students with marks more than 90 are",c)

OUTPUT:

26
16. PROGRAM TO SEARCH THE LOCATION OF AN
ELEMENT USING LINEAR SEARCH.

CODE:
#WAP TO SEARCH THE LOCATION OF AN ELEMENT USING LINEAR
SEARCH (ABDUL AHAD)

def linearsearch(l,a):

c=0

for i in range(len(l)):

if l[i]==a:

print("Element found at location",i)

c=1

if c==0:

print("Element not found")

alist=[]

n=int(input("Enter number of elements"))

for i in range(n):

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

alist.append(a)

print("List created:",alist)

s=int(input("Enter element you want to search:"))

linearsearch(alist,s)

27
OUTPUT:

17. PROGRAM TO SEARCH THE LOCATION OF AN

ELEMENT USING BINARY SEARCH.

CODE:
# WAP TO SEARCH THE LOCATION OF AN ELEMENT USING
BINARY SEARCH (ABDUL AHAD)

def binarysearch(alist,x):

a=0

28
 s=len(alist)-1

while a<=s:

m=(a+s)//2

if x==alist[m]:

return m

elif x>alist[m]:

a=m+1

else:

s=m-1

else:

return false

alist=[]

n=int(input("Enter number of elements"))

for i in range(n):

x=int(input("Enter element:"))

alist.append(x)

alist.sort()

print("List created",alist)

x=int(input("Enter element you want to search"))

p=binarysearch(alist,x)

29
print("Element found at location:",p)

OUTPUT:

18. IMPLEMENTATION OF STACK.

CODE:
# WAP TO IMPLEMENT STACK (ABDUL AHAD)

def isempty(stack):

if stack==[]:

30
 return True

else:

return False

def push(stack,item):

stack.append(item)

top=len(stack)-1

def pop(stack):

if isempty(stack):

return"underflow"

else:

item=stack.pop()

if len(stack)==0:

top=None

else:

top=len(stack)-1

return item

def peek(stack):

if isempty(stack):

return"underflow"

else:

31
 top=len(stack)-1

return stack[top]

def display(stack):

if isempty(stack):

print("stack empty")

else:

top=len(stack)-1

print("Elements in stack are:")

for a in range(top,-1,-1):

print(stack[a])

stack=[]

top=None

while True:

print("Stack Operations")

print("1. Push")

print("2. Pop")

print("3. Peek")

print("4. Display stack")

print("5. Exit")

ch=int(input("Enter your desired choice (1-5)"))

if ch==1:

32
 item=int(input("Enter item"))

push(stack,item)

elif ch==2:

item=pop(stack)

if item=="underflow":

print("Stack is empty")

else:

print("Popped item is:",item)

elif ch==3:

item=peek(stack)

if item=="underflow":

print("Stack is empty")

else:

print("Topmost item is:",item)

elif ch==4:

display(stack)

elif ch==5:

break

else:

print("INVALID CHOICE")

33
OUTPUT:

34
35