Scribd
Upload
55 views3 pages

Cs Hy Ms

The document is a marking scheme for a half yearly computer science exam for class 11. It provides the questions, expected answers and marks allocated for each part. The exam covers topics like binary, hexadecimal, logic gates, functions, loops, arrays and more. Full marks for the exam are 70 and it is allowed to be completed in 3 hours.

Uploaded by

111abhavyabhardwaj
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
55 views3 pages

Cs Hy Ms

The document is a marking scheme for a half yearly computer science exam for class 11. It provides the questions, expected answers and marks allocated for each part. The exam covers topics like binary, hexadecimal, logic gates, functions, loops, arrays and more. Full marks for the exam are 70 and it is allowed to be completed in 3 hours.

Uploaded by

111abhavyabhardwaj
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/ 3

KENDRIYA VIDYALAYA SANGATHAN SET-I (MS)

COMPUTER SCIENCE (083) THEORY


HALF YEARLY EXAMINATION 2019-20
MARKING SCHEME
Allowed: 3.00 Hours Class – XI Maximum Marks: 70

1 a) 1024 x 1024 OR 220 ( 1 MARK FOR CORRECT ANSWER) 1


b) ½ MARK FOR EACH CORRECT FUNCTION 1
c) 1 MARK FOR CORRECT DEFINITION. 1
d) 2 MARKS FOR TWO CORRECT POINT OF DISTINCTION 2
e) 2 MARKS FOR CORRECT DIAGRAM 2
f) 1 AMRK FOR CORRECT De-Morgan’s LAW AND 1 MARK FOR TRUTH 2
TABLE
g) 1 MARK FOR CORRECT DEFINITION AND 2 MARKS FOR CORRECT 3
EXPLANATION
h) 1 MARK FOR EACH CORRECT EXPLANTIONS 4
i) i. (1011010)2 = ( 5A) 16 2
ii. (723)8=( 467) 10
1 MARK FOR EACH CORRECT VALUE
j) 2 MARKS FOR CORRECT FLOW CHART, 1 MARK FOR PARTIAL 2
CORRECT

2 a) 1 MARK FOR CORRECT ANSWER 1


b) int ( 1 MARK FOR CORRECT ANSWER) 1
c) Break, keyword, (1/2 MARK FOR EACH CORRECT ONE) 1
d) 1 MARK FOR ANY CORRECT ESCAPE SEQUENCE USED 1
e) 256 (1 MARK FOR CORRECT VALUE) 1
c) 1 MARK FOR DEFINITION AND 1 MARK FOR EXAMPLE 2
3 a) OUTPUT 2
2.26
2.0
(1 MARK FOR EACH CORRECT OUTPUT)
b) 10 36 8 7 (2 MARKS FOR CORRECT OUTPUT) 2
c) 2 MARKS FOR CORRECT PROGRAM, 2
(1/2 MARK FOR CORRECT INPUT STATEMENT,
1/2 MARK FOR CORRECT OUTPUT STATEMENT
1 MARK FOR SWAPPING STATEMNT)
d) 3 MARKS FOR CORRECT PROGRAM, 1 MARK FOR CORRECT INPUT, 1 3
MARK FOR CORRECT OUTPUT
4 a) 3 (1 MARK FOR CORRECT VALUE) 1
b) CD 2
( 1 MARK FOR EACH CORRECT OUTPUT)

c) 2 MARKS FOR TWO CORRECT POINT OF DISTINCTION 2

Page 1 of 3
d) 2 MARKS FOR TWO CORRECT POINT OF DISTINCTION 2
5 a) n=10 2
answer=1
while (n<100):
answer= answer + n**2
n=n+1
print(answer)

(1 MARK FOR EACH CORRECT ERROR DETECTION AND


CORRECTION)
b) () 3
80,83,86
88,85
88,85,80
83,86
80

½ MARK FOR EACH CORRECT OUTPUT

c) for i in range(4): 3
for j in range(4,i,-1):
print( j, end= ’ ‘ )
else :
print( )
OR ANY OTHER METHOD

2 MARKS FOR USING FOR CONDITION


1 MARK FOR PRINT FUNCTION

d) #Program to print the numbers between 0-100 which are divisible by 7 and 9 4
both and counting them.

count=0
for i in range(0,101)
if i % 7 == 0 and i % 9 == 0:
count=count+1
print(i)
print( count)
OR ANY OTHER METHOD

1 MARK FOR CORRECT DECLARATION


1 MARK FOR SELECTING CORRECT RANGE
1 MARK FOR COUNTING
1 MARK FOR PRINTING

e) ½ MARK FOR INPUT 4


½ MARK FOR EACH CORRECT CONDITION
½ MARK FOR OUTPUT

6 a) 2 MARKS FOR TWO CORRECT POINT OF DISTINCTION 2

Page 2 of 3
b) VARIABLE a WILL STORE () 3
VARIABLE b WILL STORE (80,88,83,86)
VARIABLE c WILL STORE (88,85)
VARIABLE d WILL STORE (80,85,80,88)
VARIABLE e WILL STORE (83,86)
VARIABLE f WILL STORE (80,88)

½ MARK FOR EACH CORRECT OUTPUT

c) i. 20 2
ii. [1, 2, 30]

1 MARK FOR EACH CORRECT OUTPUT


d) 1 MARK FOR CORRECT INPUT 4
2 MARKS FOR CORRECT CONDITION AND LOGIC
1 MARK FOR PRINTING

Page 3 of 3

You might also like