0% found this document useful (0 votes)
13 views7 pages

CS-XII-MS-PB-2024-25-SET-I A

The document outlines the marking scheme for the Pre-Board Examination in Computer Science for Class XII under Kendriya Vidyalaya Sangathan, Ahmedabad Region for the academic year 2024-25. It details the structure of the question paper, including the number of questions, marks distribution across different sections, and specific instructions regarding programming language usage. The document also includes sample questions and answers, demonstrating the expected format and content for the examination.

Uploaded by

kumarankitk33
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views7 pages

CS-XII-MS-PB-2024-25-SET-I A

The document outlines the marking scheme for the Pre-Board Examination in Computer Science for Class XII under Kendriya Vidyalaya Sangathan, Ahmedabad Region for the academic year 2024-25. It details the structure of the question paper, including the number of questions, marks distribution across different sections, and specific instructions regarding programming language usage. The document also includes sample questions and answers, demonstrating the expected format and content for the examination.

Uploaded by

kumarankitk33
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

कें द्रीय विद्यालय संगठन, अहमदाबाद संभाग SET-1/A

KENDRIYA VIDYALAYA SANGATHAN, AHMEDABAD REGION


प्री-बोर्ड परीक्षा:2024-25
PRE-BOARD EXAMINATION: 2024-25
MARKING SCHEME

SUBJECT : COMPUTER SCIENCE(083) TIME : 3 HOURS


CLASS :XII MM : 70
----------------------------------------------------------------------------------------------------
GENERAL INSTRUCTIONS:
 This question paper contains 37 questions.
 All questions are compulsory. However, internal choices have been provided in some
questions. Attempt only one of the choices in such questions
 The paper is divided into 5 Sections- A, B, C, D and E.
 Section A consists of 21 questions (1 to 21). Each question carries 1 Mark.
 Section B consists of 7 questions (22 to 28). Each question carries 2 Marks.
 Section C consists of 3 questions (29 to 31). Each question carries 3 Marks.
 Section D consists of 4 questions (32 to 35). Each question carries 4 Marks.
 Section E consists of 2 questions (36 to 37). Each question carries 5 Marks.
 All programming questions are to be answered using Python Language only.
 In case of MCQ, text of the correct answer should also be written.

Q.NO SECTION-A(21x1=21 Marks) MARKS

1 False (1)

2 (C) 200 (1)

3 (D) s1[4]= “Y” (1)

4 False (1)

5 (A) ['All ', 'he Bes', ''] (1)

6 (B) ( ) (1)

7 (C) {'A':4000, 'B':2500, 'C':3000} (1)

8 remove() (1)

9 (B) r+ (1)

10 (B) File.seek(-10,2) (1)

11 True (1)

12 (C) 20#50@20 (1)

13 IS NULL (1)

Page 1 of 7
14 (B) GROUP BY (1)

15 (C) CHAR (1)

16 (D) All of these (1)

17 (B) POP3 (1)

18 (B) Modulator (1)

19 (B) Fiber optic cable (1)

20 (A)Both A and R are true and R is the correct explanation for A (1)

21 (D)A is False but R is True (1)

Q.NO SECTION-B(7x2=14 Marks) MARKS

22 ['E', 'a', 'i', 'a', 'i', 'n'] (2)

23 Any two correct differences between compile time and run time error (2)

24 (A) @40 OTNMX RO R@ (2)


OR
(B) dict_items([('name', 'SAM'), ('age', 27), ('address', 'MUMBAI')])
25 (A) and(D) are possible outputs (2)
Maximum:0
Minimum:3
26 def prime(): (2)
n=int(input("Enter number to check :: ")) #bracket missing
for i in range (2, n//2):
if n%i==0: # = missing
print("Number is not prime \n")
break #wrong indent
else:
print("Number is prime \n”) # quote mismatch
(½ mark for each correct correction made and underlined)
27 (I) A) SHOW TABLES (2)
OR
B) INSERT INTO
(II)A) ALTER TABLE <table name> DROP PRIMARY KEY;
OR
B) ALTER TABLE <table name> ADD PRIMARY KEY ( <primary key>);

(1 mark each for correct answer)


28 (i) POP – Post Office Protocol (2)

Page 2 of 7
(ii) HTTPS: Hyper Text Transfer Protocol Secure
OR
(i) Telnet
(ii) FTP
Q.NO SECTION-C(3x3=9 Marks) MARKS

29 def SHOWLINES(): (3)


f=open("EXAMCS.txt")
for line in f:
if 'ke' not in line:
print(line.strip())
f.close()
OR
def RainCount():
f=open('rain.txt')
data=f.read()
data=data.upper()
data=data.split()
c=data.count('RAIN')
print('Rain -',c)
f.close()
Any other correct code
(½ mark for correct function header)
(½ mark for correctly opening the file)
(½ mark for correctly reading from the file)
( ½ mark for splitting the text into words)
(1 mark for correctly displaying the desired output)
30 status=[] (3)
def Push_element(cust):
if cust[2]=="Goa":
L1=[cust[0],cust[1]]
status.append(L1)
def Pop_element ():
num=len(status)
while len(status)!=0:
dele=status.pop()
print(dele)
num=num-1
else:

Page 3 of 7
print("Stack Empty")

(1.5 marks for correct push_element() and 1.5 marks for correct
pop_element())
OR
stackItem=[]
def Push(SItem):
count=0
for k in SItem:
if (SItem[k]>=75):
stackItem.append(k)
count=count+1
print("The count of elements in the stack is : ", count)
(1 mark for correct function header
1 mark for correct loop
½ mark for correct If statement
½ mark for correct display of count)
31 aLL#tHE#bEes (3)
OR
S*u**n*S*
(deduct ½ mark for not printing * #)
Q.NO SECTION-D(4x4=16 Marks) MARKS

32 A) (4)
(i) SELECT * FROM TECH_COURSE WHERE CNAME LIKE ‘D%’;
(ii) SELECT FEES FROM TECH_COURSE ORDER BY FEES DESC;
(iii) SELECT SUM(FEES) AS TOTAL_FEES FROM TECH_COURSE WHERE TID IS
NOT NULL;
(iv) SELECT CNAME FROM TECH_COURSE WHERE FEES <15000;
OR
B) Write the output of following queries:
(i)

(ii)

Page 4 of 7
(iii)

(iv) 15500.00
(4 x 1 mark for each correct output)
33 import csv (4)
def ADD():
fout=open("record.csv","a",newline="\n")
wr=csv.writer(fout)
empid=int(input("Enter Employee id :: "))
name=input("Enter name :: ")
mobile=int(input("Enter mobile number :: "))
lst=[empid,name,mobile] ---------1/2 mark
wr.writerow(lst) ---------1/2 mark
fout.close()
def COUNTR():
fin=open("record.csv","r",newline="\n")
data=csv.reader(fin)
d=list(data)
print(len(d))
fin.close()
ADD()
COUNTR()
(½ mark for importing csv module
1½ marks each for correct definition of ADD() and COUNTR()
½ mark for function call statements)
34 i)Primary Key – Rollno (4)
ii)Degree of table= 5
iii)Insert into fees values(101,’Aman’,’XII’,5000);
iv)(A) DELETE FROM Fees;
OR
iv)(B) Desc Fees;
(4x1 mark for each correct query)
35 import mysql.connector as mysql (4)
def DataDisplay():
con1=mysql.connect(host="localhost",user="root",password="tiger",
database="school")
mycur= con1.cursor()
no=int(input("Enter Roll Number: "))
Page 5 of 7
nm=input("Enter Student Name: ")
class=int(input("Enter class: "))
marks=float(input("Enter marks: "))
query="INSERT INTO student VALUES ({},'{}',{},{})"
query=query.format(no,nm,class,marks)
mycur.execute(query)
con1.commit()
print("Students with marks greater than 75 are : ")
mycursor.execute("select * from student where Marks>75")
data= mycursor.fetchall()
for i in data:
print(i)
print()
(½ mark for correctly importing the connector object)
(½ mark for correctly creating the connection object)
(½ mark for correctly creating the cursor object)
(½ mark for correctly inputting the data)
(½ mark for correct creation of first query)
(½ mark for correctly executing the first query with commit)
(½ mark for correctly executing the second query)
(½ mark for correctly displaying the data)
Q.NO SECTION-E(2x5=10 Marks) MARKS

36 import pickle (5)


defcreateFile():
fobj=open("Book.dat","ab")
BookNo=int(input("Book Number : "))
Book_name=input("Name :")
Author = input("Author:" )
Price = int(input("Price : "))
rec=[BookNo,Book_Name,Author,Price]
pickle.dump(rec,fobj)
fobj.close()
defCountRec(Author):
fobj=open("Book.dat","rb")
num = 0
try:
while True:
rec=pickle.load(fobj)

Page 6 of 7
if Author==rec[2]:
num = num + 1
except:
fobj.close()
return num
Any other correct code
(1 mark of import pickle and function def)
(1 mark for input)
(1/2 mark for opening file in append mode and 1/2 mark for using dump)
(1/2 mark for opening file in read mode and 1/2 mark for using load)
(1 mark for checking the condition and updating the value)
(1 mark for checking the condition and displaying data correctly)
37 i) Layout- (5)

ii)The most appropriate location of the server would be Research Lab, as this
building contains the maximum number of computers.
(iii)
a) For layout1, since the cabling distance between Accounts to Store is quite
large, so a repeater would ideally be needed along their path to avoid loss of
signals during the course of data flow in this route. For layout2, since the
cabling distance between Store to Research Lab is quite large, so a repeater
would ideally be placed.
b) In both the layouts, a Hub/Switch each would be needed in all the
buildings to interconnect the group of cables from the different computers in
each building.
(iv) Firewall
(v) A) Twisted Pair cable / Ethernet cable
OR
B) LAN
(1 mark for correct answer)
************

Page 7 of 7

You might also like