0% found this document useful (0 votes)
49 views

Set 1 Xii CS PB2 MS

This document contains the marking scheme for a Computer Science pre-board exam for class 12. It includes multiple choice and long answer questions across 4 sections - Section A has short answer questions, Section B contains code-writing questions, Section C involves SQL queries and output, and Section D deals with database concepts. Marks are awarded for each correct answer, part of code, or query according to the marking criteria specified.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
49 views

Set 1 Xii CS PB2 MS

This document contains the marking scheme for a Computer Science pre-board exam for class 12. It includes multiple choice and long answer questions across 4 sections - Section A has short answer questions, Section B contains code-writing questions, Section C involves SQL queries and output, and Section D deals with database concepts. Marks are awarded for each correct answer, part of code, or query according to the marking criteria specified.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

KENDRIYA VIDYALAYA SANGATHAN, BHOPAL REGION

II PRE-BOARD EXAMINATION (2023-24)


CLASS : XII
SUB: COMPUTER SCIENCE (083)
[Time : 03 hours ] [Maximum Marks : 70]
MARKING SCHEME

SECTION A
1 False 1
2 D) Alternate Key 1
3 B) None 1
4 A)'welcome#to#kvs#bhopal' 1
5 (A) 5,15 1
6 (B) VOIP 1
7 (D) Statement 4 1
8 (A) 73nh 1
9 (B) tp1[2] = 20 1
10 (C) 0,6 1
11 (C) switch 1
12 (C) 40 1
13 True 1
14 (D) Drop 1
15 (D) tell() 1
16 (B) mysql-connector 1
17 (B) Both A and R are true and R is not the correct explanation for A 1
18 (A) Both A and R are true and R is the correct explanation for A 1
SECTION B
19 Simple mail transfer protocol ½ 1
Dynamic Hyper text markup language ½ +1
1 mark for correct difference
Or
Domain Name System ½
Uniform Resource Locator ½
1 mark for correct difference
20 def checkNumber(N): 2

if N>0:
print(“This is positive number”)
else:

print(“This is negative “)
return
#main-code
num = int ( input (“ Enter a number to check : “) )
k = checkNumber (num)
½ mark for each correction and underline
21 def listchange(Arr): ½ mark 2
x=len(Arr)
for i in range(0,x): ½ mark
if (Arr[i][ %2 == 0: ½ mark
Arr[i] = 0
else:
Arr[i] = Arr[i] * 3 ½ mark
½ mark or proper defining, ½ for proper loop, ½ for checking condition and ½ for
even and odd assignment.
22 [25, 196] 1 mark for proper value and 1 for in list manner 2
22 wd = input(“Enter a word”) 2
p = len(wd)
print(“The Pattern:)
for i in range(0,6):
for j in range(0, i+1):
print (wd[i],end = ‘ ‘)
print()

(1 marks for proper nested loop and 1 mark for display


OR
i) exam.append(‘maths’)
ii) exam.sort(reverse=True)
(1 mark for each correct answer)
24 SELECT * FROM EMPLOYEE WHERE department=‟Sales‟ or department= 2
“IT‟; OR
SELECT * FROM EMPLOYEE WHERE department IN (‘Sales’,’IT’)
2 mark for correct query.
OR
1 mark for each correct query.
25 (a) Vidyalay 2
(b) 3
(1 mark for each correct answer)
SECTION C
26 bzZtogGA 3
27 1 mark for each correct query output. 3
28 def count_W_H(): 3

W,H = 0,0
r = f.read()for x
in r:
if x[0]== ‘W’ or x[0] = ‘w’:
W=W+1
if x[0]== ‘H’ or x[0] = ‘h’:
H=H+1
f.close()

OR
def countwords():
s = open("Quotes.txt","r")
f = s.read()
z = f.split ()count
= 0 for I in z:
count = count + 1
print ("Total number of words:", count)
Note: Using of any correct code giving the same result is alsoaccepted.
29 a) Alter table Book add publisher varchar(20); 3
b) Update Book set price = price +( price * 5) /100 where price > 200;
c) Delete from book where bname line ‘%FIRST%;
30 def PushBook(Book): 3
bno = input("Enter book no :”)btitle=
input("Enter title : ")
rec = bno + “ “ + btitle
Book.append(rec)
print(Book)
OR
def PopBook(Book) :
if len(Book)==0: # If stack is empty
print("Underflow")
else:

½ marks for correct function header1½


marks for correct logic
½ mark for proper use of append or pop function
½ mark for correct output statement
SECTION D
31 3+½
i) Select * from TRANSACT where TYPE=’Withdraw’; +½
ii) Select ANO, AMOUNT from TRANSACT where DOT like ‘%-05-%’;
iii) Select ANO,T.ANO,ANAME,AMOUNT from ACCOUNT A, TRANSACT T
where A.ANO = T.ANO and AMOUNT<=3000;
iv) ANO ANAME
103 Ali Reza
105 Simran Kaur
v) Ano
101
103
103
1 mark for correct query and ½ each for correct output
32 (i) CSV (1 mark) 4
(ii) "w" (1 mark)
(iii) reader, close() (2 marks for both correct answers)
33 (i) 1 Mark for correct Layout. 5
(ii) Research Lab ( 1 Mark)
(iii) 1 Mark for correct Justification.
(iv) Antivirus/ Firewall (1 Mark for Correct Answer)
(v) 1 Mark for correct Justification.
34 1. For correct definition 1 mark and 1 mark for correct example 2
2.
a. mycursor=conn.cursor() Statement1
b. mycursor.execute(sql) Statement2
3
c. conn.commit() Statement 3
OR
i) 2 marks for correct Answer.
ii)import pickle
def countrec ():
fobj=open(‘student.dat’,’rb’)
num=0
try:
while True:
rec=pickle.load(fobj)
if rec[2]>90:
num=num+1
print(re[0],rec[1],rec[2])
except:
fobj.close()
return num
35 import pickle 5
def createFile():
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()
def CountRec(Author):
fobj=open("Book.dat","rb")
num = 0
try:
while True:
rec=pickle.load(fobj)
if Author==rec[2]:
num = num + 1
except:
fobj.close()
return num
OR
import pickle
def CountRec():
fobj=open("STUDENT.DAT","rb")
num = 0
try:
while True:
rec=pickle.load(fobj)
if rec[2] > 90:
print(rec[0],rec[1],rec[2],sep="\t")
num = num + 1
except:
fobj.close()
return num
½ mark for import
½ mark for proper opening file
1 mark for loop 1 for condition
1 mark for proper load / dump function
½ for proper close ½ for return statement

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy