COMPUTER SCIENCE PAPER 1
(THEORY)
----------------------------------------------------------------------------------------------------------------
Maximum Marks: 70
Time Allowed: Three Hours
(Candidates are allowed additional 15 minutes for only reading the paper.
They must NOT start writing during this time.)
---------------------------------------------------------------------------------------------------------------------------
Answer all questions in Part I (compulsory) and six questions from Part-II,
choosing two questions from Section-A, two from Section-B and
two from Section-C.
All working, including rough work, should be done on the same sheet as the
The intended marks for questions or parts of questions are given in brackets [ ].
----------------------------------------------------------------------------------------------------------------
PART I – 20 MARKS
Answer all questions.
While answering questions in this Part, indicate briefly your working and reasoning,
wherever required.
Question 1
(i) Absorption law states that: [1]
(a) A • ( Aꞌ + B) = A
(b) A + ( A • B) = A
(c) Both (a) and (b)
(d) A•(B+C)=A•B + A•C
(ii) Assertion : A=0 B=1 C=0 and D=1 and minterm is Aꞌ•B•Cꞌ•D [1]
Reason : The final sum term must be 0 so A and C are complemented.
Which one of the following options is correct?
(a) Both Assertion and Reason are true, and Reason is the correct explanation
for Assertion.
(b) Both Assertion and Reason are true, but Reason is not the correct
explanation for Assertion.
(c) Assertion is true and Reason is false.
(d) Assertion is false and Reason is true.
---------------------------------------------------------------------------------------------------------------------
ISC SPECIMEN QUESTION PAPER 2024
1
, (iii) According to the Principle of duality, the Boolean equation [1]
(P + Qꞌ) • R • 1 = P • R + Qꞌ • R will be equivalent to:
(a) P • Qꞌ + R + 1 = (P + R) • (Qꞌ + R)
(b) P • Qꞌ + R + 0 = (P + R) • (Qꞌ + R)
(c) Pꞌ • Q + R + 1 = (Pꞌ • Rꞌ) • (Q + Rꞌ)
(d) P • Qꞌ + R • 0 = (P + R) • (Qꞌ + R)
(iv) The complement of the Boolean expression (X • Y)′ + Z′ is: [1]
(a) (X + Y) • Z
(b) X•Y•Z
(c) (Xꞌ + Yꞌ) • Zꞌ
(d) (Xꞌ + Yꞌ) • Z
(v) The equivalent of P ˄ Q ˅ ~ P ˄ ~ Q will be: [1]
(a) ((P˄Q) ˅ ~P)˄ ~Q
(b) (P˄Q )˅( ~P ˄ ~Q)
(c) P˄(Q ˅ ~P) ˄ ~Q
(d) P ˄ ( Q ˅ (~ P ˄ ~ Q ) )
(vi) Assertion : Boolean algebra and Binary number system are different from each [1]
other.
Reason : There are some basic operations like AND, OR and NOT which are
performed only in Boolean algebra.
(a) Both Assertion and Reason are true, and Reason is the correct explanation for
Assertion.
(b) Both Assertion and Reason are true, but Reason is not the correct explanation
for Assertion.
(c) Assertion is true and Reason is false.
(d) Assertion is false and Reason is true.
(vii) What is the relevance of the keyword static for a data member of a class [1]
(viii) State any one purpose of using interfaces in Java programming. [1]
(ix) Define Canonical form of an expression with respect to its Cardinal form. [1]
(x) State any one application each of half adder and full adder. [1]
----------------------------------------------------------------------------------------------------------------------------------
ISC SPECIMEN QUESTION PAPER 2024
2
(THEORY)
----------------------------------------------------------------------------------------------------------------
Maximum Marks: 70
Time Allowed: Three Hours
(Candidates are allowed additional 15 minutes for only reading the paper.
They must NOT start writing during this time.)
---------------------------------------------------------------------------------------------------------------------------
Answer all questions in Part I (compulsory) and six questions from Part-II,
choosing two questions from Section-A, two from Section-B and
two from Section-C.
All working, including rough work, should be done on the same sheet as the
The intended marks for questions or parts of questions are given in brackets [ ].
----------------------------------------------------------------------------------------------------------------
PART I – 20 MARKS
Answer all questions.
While answering questions in this Part, indicate briefly your working and reasoning,
wherever required.
Question 1
(i) Absorption law states that: [1]
(a) A • ( Aꞌ + B) = A
(b) A + ( A • B) = A
(c) Both (a) and (b)
(d) A•(B+C)=A•B + A•C
(ii) Assertion : A=0 B=1 C=0 and D=1 and minterm is Aꞌ•B•Cꞌ•D [1]
Reason : The final sum term must be 0 so A and C are complemented.
Which one of the following options is correct?
(a) Both Assertion and Reason are true, and Reason is the correct explanation
for Assertion.
(b) Both Assertion and Reason are true, but Reason is not the correct
explanation for Assertion.
(c) Assertion is true and Reason is false.
(d) Assertion is false and Reason is true.
---------------------------------------------------------------------------------------------------------------------
ISC SPECIMEN QUESTION PAPER 2024
1
, (iii) According to the Principle of duality, the Boolean equation [1]
(P + Qꞌ) • R • 1 = P • R + Qꞌ • R will be equivalent to:
(a) P • Qꞌ + R + 1 = (P + R) • (Qꞌ + R)
(b) P • Qꞌ + R + 0 = (P + R) • (Qꞌ + R)
(c) Pꞌ • Q + R + 1 = (Pꞌ • Rꞌ) • (Q + Rꞌ)
(d) P • Qꞌ + R • 0 = (P + R) • (Qꞌ + R)
(iv) The complement of the Boolean expression (X • Y)′ + Z′ is: [1]
(a) (X + Y) • Z
(b) X•Y•Z
(c) (Xꞌ + Yꞌ) • Zꞌ
(d) (Xꞌ + Yꞌ) • Z
(v) The equivalent of P ˄ Q ˅ ~ P ˄ ~ Q will be: [1]
(a) ((P˄Q) ˅ ~P)˄ ~Q
(b) (P˄Q )˅( ~P ˄ ~Q)
(c) P˄(Q ˅ ~P) ˄ ~Q
(d) P ˄ ( Q ˅ (~ P ˄ ~ Q ) )
(vi) Assertion : Boolean algebra and Binary number system are different from each [1]
other.
Reason : There are some basic operations like AND, OR and NOT which are
performed only in Boolean algebra.
(a) Both Assertion and Reason are true, and Reason is the correct explanation for
Assertion.
(b) Both Assertion and Reason are true, but Reason is not the correct explanation
for Assertion.
(c) Assertion is true and Reason is false.
(d) Assertion is false and Reason is true.
(vii) What is the relevance of the keyword static for a data member of a class [1]
(viii) State any one purpose of using interfaces in Java programming. [1]
(ix) Define Canonical form of an expression with respect to its Cardinal form. [1]
(x) State any one application each of half adder and full adder. [1]
----------------------------------------------------------------------------------------------------------------------------------
ISC SPECIMEN QUESTION PAPER 2024
2
