0% found this document useful (0 votes)
10 views9 pages

ms_csxii_pb1_set3

The document outlines the marking scheme for the First Pre-Board Examination 2024-25 for Class XII Computer Science at Kendriya Vidyalaya Sangathan Agra Region. It includes various sections with questions covering topics such as programming, data structures, and database queries, totaling a maximum of 70 marks. The examination is structured into multiple sections with different types of questions, including true/false, short answer, and coding problems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views9 pages

ms_csxii_pb1_set3

The document outlines the marking scheme for the First Pre-Board Examination 2024-25 for Class XII Computer Science at Kendriya Vidyalaya Sangathan Agra Region. It includes various sections with questions covering topics such as programming, data structures, and database queries, totaling a maximum of 70 marks. The examination is structured into multiple sections with different types of questions, including true/false, short answer, and coding problems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

केन्द्रीय विद्यालय संगठन आगरा संभाग

प्रथम प्री बोर्ड परीक्षा 2024-25

KENDRIYA VIDYALAYA SANGATHAN AGRA REGION


First Pre-Board Examination-2024-25

CLASS XII -COMPUTER SCIENCE (083)


Marking Scheme
अधिकतम समय : घंटे अधिकतम अंक : 70
Max. Time –3 hours Max. marks –
70

Q.N SECTION-A (21 x 1 = 21 MARKS) Marks


o

1 True 1

2 c. [‘Manoj’, ‘Suresh’, ‘Vaibhav’] 1

3 False 1

4 a. 4 1

5 a. -a-ssistance 1

6 b. ‘python’+2 1

7 c. L.del(3) 1

8 d={12101:’Krishna’, 12102:’prarabdh’, 12103:’shorya’} 1

9 d. Primary key 1

10 c. file pointer will move 10 byte in forward direction from 1


current location

11 d. 1

12 a. 21, 7 1

13 b. 13, 8 1

14 d. show tables 1

Page 1 of 9
15 b. delete 1

16 d. None of the above 1

17 d. PAN 1

18 c. NIC Card 1

19 a. Packets 1

20 c. A is true but R is false 1

21 b. Both A and R are true and R is not the correct explanation for 1
A

Q.N SECTION – B ( 7 * 2 = 14 Marks) Marks


o

22 a. Boolean 2
b. String
c. Float
d. Int

23 27 2

24 A. 1. S1.isdigit() 2
2. del L1[3:8]
B. 1. Exam.append(‘computer science’)
2. Exam.sort(reverse=True)

25 (a) 41 $ 38 $ 38 $ 37 $ 2
(d) 40 $ 37 $ 39 $ 35 $
Maximum value of Num when P = 7 : 41
Minimum value of Num when P = 7 : 35

26 def checkval ( ): 2

Page 2 of 9
x = int( input("Enter a number") )

if x % 2 == 0:

print (x, "is even")

elif x<0:

print (x, "should be positive")

else:

print (x, "is odd")

27 1. because of not null constraint 2


2. because of unique or primary key
OR
1. NULL is present in C1 column
2. Ignored

28 A. 1. Post Office Protocol 2

2. Hyper Text Transfer Protocol Secure

B. Hub: broadcasting of data


Switch: intelligently transfer the data to the designated
recipient.
OR
A. 1. Voice over Internet Protocol

2. File Transfer Protocol

B. Set of rules

Q.N SECTION – C ( 3 * 3 = 9 Marks) Marks


o

29 def show_words(): 3

f=open('d://notes.txt','r')

Page 3 of 9
for i in f.read():

print(i.upper(),end='')

show_words()

OR

def read_story():

f=open('d://notes.txt','r')

for i in f.read().split():

if i[-1].lower()=='h':

print(i)

read_story()

30 stk=[] 3

Lst=[2,5,6,8,24,32]

def PushE1(Lst):

for x in Lst:

if x % 4 ==0 :

stk.append(x)

def popE1( ):

if len(stk)==0 :

print(‘Underflow’)

else:

print(stk.pop(), ‘ is deleted’)

OR

Page 4 of 9
msg='All the Best for your Pre-Board Examination'

stk=[]

def pushData():

for i in msg:

if i.isupper():

stk.append(i)

def popData():

while stk:

print(stk.pop(),end='')

else:

print('\nEnd of stack')

pushData()

popData()

31 S1U3E5Ts

OR

a*!

Q.N SECTION – D ( 4 * 4 = 16 Marks) Marks


o

Page 5 of 9
32 4

OR

1. Select subject, count(*) from school group by subject;


2. Select TeacherName, experience from school where
TeacherName like ‘P%I’ ;
3. Insert into school values(1743, ‘Manoj’, ‘Computer
Science’, ‘2004-05-10’, 20, 6) ;
4. Select subject, HOD from school, admin where
school.code=admin.code and designation=’HOD’

33 a. 4

import csv

def search():

f=open('d://testcsv.csv','r')

fobj=csv.reader(f)

next(fobj)

for i in fobj:

if int(i[3])>1000:

print(i)

Page 6 of 9
b.

import csv

def countR():

f=open('d://testcsv.csv','r')

fobj=csv.reader(f)

next(fobj)

sum=count=0

for i in fobj:

count=count+1

sum=sum+int(i[4])

print('Average cost : ',sum/count)

countR()

34 a. SELECT * FROM STOCK WHERE Itname LIKE “%pen%”; 4


b. SELECT Itname FROM STOCK, DEALERS WHERE
STOCK.Dcode= DEALERS.Dcode and Dname=’ Vikash
Stationers’;
c. SELECT Itname, StkDate FROM STOCK ORDER BY
StkDate;
d. SELECT Itname, Qty, Dname FROM STOCK, DEALERS
WHERE STOCK.Dcode= DEALERS.Dcode and qty > 40;
OR
SELECT * FROM STOCK WHERE UnitPrc BETWEEN 11 AND
50;

35 import mysql.connector as BD 4

def Emp_Database():

Page 7 of 9
con=BD.connect(host="localhost", user="root",

password="bharat", database="TOUR")

BDcursor=con.cursor()

print("Travels at Hilly Area and the distance more than


1000 KM.:")

BDcursor.execute("select * from TRAVELS WHERE

Geo_Cond =’hilly area" AND Distance <1000)

TravelRec=BDcursor.fetchall()

For rec in TravelRec:

print(rec)

Q.N SECTION – E ( 5 * 2 = 10 Marks) Marks


o

36 import pickle 5
f1=open(‘Result.dat’,’ab’)

while True:

Student_Id=int(input(("Enter Student Id:")))

St_name=input("Enter name:")

Game_Name=input("Enter Salary:")

Result= input(“Enter Result:”)

data=[Student_Id, St_Name, Game_Name,Result]

pickle.dump(data,f1)

Choice=input("Wish to enter more records: Y/N")

if Choice.upper()=='N':

Page 8 of 9
break

f1.close()

OR

import pickle
fout=open("Result.dat",'rb')
try:
while True:
data = pickle.load(fout)

if data[3].lower()== ‘won’:

print(data)

except EOFError:

fout.close()

37 I. layout with shortest Wire length or any other efficient 5


layout with proper justification.
II. Between 3 and 4 due to larger distance
III. (a) Wireless

(b) WAN

IV. Building-3 due to maximum no of Computers

V. Co- axial cable or fiber optics


OR
Hub / Switch

Page 9 of 9

You might also like