LONG TEST- 1 (2025-2026)

COMPUTER SCIENCE
Grade:XII Maximum Marks: 40
Date: 23/04/2025 Duration: 1 Hour 30 Mins
________________________________________________________________
-Answer all questions in Part I (compulsory) and four 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 – 10 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
Reason : The final sum term must be 0 so A and C are complemented.
[1]
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

(iii) According to the Principle of duality, the Boolean equation

(P + Qꞌ) • R • 1 = P • R + Qꞌ • R will be equivalent to:

___________________________________________________________________________________________
This question paper consist of ___ printed pages

1
 [1]
(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
other.
Reason : There are some basic operations like AND, OR and NOT which are
performed only in Boolean algebra.
[1]
(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) Write the minterm of F(A, B, C, D) when A = 1, B = 0, C = 0 and D = 1. [1]

(viii) Verify if (A + A’)’ is a Tautology, Contradiction, or a Contingency. [1]

(ix)If (~p => ~q) then its contra positive will be: [1]
(a) p => q
(b) q => p
(c) ~q => p
(d) ~p => q

(x) ) The dual of (X’ + 1) . (Y’ + 0) = Y’ is: [1]

(a) X . 0 + Y . 1 = Y
(b) X’ . 1 + Y’ . 0 = Y’
(c) X’ . 0 + Y’ . 1 = Y’
(d) (X’ + 0) + (Y’ + 1) = Y’
2
 PART II – 30 MARKS
Answer all questions in this part, from Section A & Section B .
SECTION - A
Answer any two questions.
Question 3
(i) Given the Boolean function F(A, B, C, D) = S(2, 3, 6, 7, 8, 10, 12, 14, 15).
(a) Reduce the above expression by using 4-variable Karnaugh map, showing the various
groups (i.e., octal,quads and pairs). [4]
(b) Draw the logic gate diagram for the reduced expression. Assume that the variables and
their complements are available as inputs. [1]
(ii) Given the Boolean function F(A, B, C, D) = p(0, 1, 2, 4, 5, 8, 10, 11, 14, 15).
(a) Reduce the above expression by using 4-variable Karnaugh map, showing the various
groups (i.e., octal,
quads and pairs). [4]
(b) Draw the logic gate diagram for the reduced expression. Assume that the variables and
their complements are available as inputs. [1]

Question 4
(i) A shopping mall allows customers to shop using cash or credit card or any nationalised
bank. It awards’ bonus
points to their customers on the basis of criteria given below: [5]
 The customer is an employee of the shopping mall and makes the payment using a
credit card.
OR
 The customer shops items which carry bonus points and makes the payment using a
credit card with a shopping amount of less than `10,000
OR
 The customer is not an employee of the shopping mall and makes the payment not
through a credit card but in cash for the shopping amount above `10,000
The inputs are:

Inputs
C Payment through a credit card
A Shopping amount is above `10,000
E The customer is an employee of the shopping mall
I Item carries a bonus point
(In all the above cases, I indicates yes and 0 indicated nd.)
Output: X[1 indicates bonus point awarded, 0 indicates bonus point not awarded for all
cases]
Draw the truth table for the inputs and outputs given above and write the POS expression for
X(C, A, E, I).

3
 OR

(a) Reduce the Boolean function F(A,B,C,D) = π (0, 1, 2, 3, 4, 6, 9, 11, 13) by

using 4-variable Karnaugh map, showing the various groups (i.e. octal, quads
and pairs).[4]
(b) Draw the logic gate diagram for the reduced expression. Assume that the
variables and their complements are available as inputs.[1]

SECTION -B

Question 5

(i)Write the canonical sum of product form of the function y(A,B) = A + B. [1]
(ii) Convert the following cardinal expression to its canonical form: [2]
F(P, Q, R) = π ¿0, 1, 3, 4)
(iii)Simplify the following expression using Boolean laws:
F = PQ + ( P + Q ) • ( P + PR ) + Q [2]

Question 6
(i) A Football Association coach analyses the criteria for a win/draw of his team
depending on the following conditions.

• If the Centre and Forward players perform well but Defenders do not perform well.
OR
• If Goalkeeper and Defenders perform well but the Centre players do not perform well.
OR
• If all perform well.
The inputs are:
INPUTS

C Centre players perform well

D Defenders perform well
F Forward players perform well
G Goalkeeper perform well

(In all the above cases, 1 indicates yes and 0 indicates no.)
Output: X - Denotes the win/draw criteria [1 indicates win/draw and 0 indicates
defeat in all cases]
Draw the truth table for the inputs and outputs given above and write the
SOP expression for X(C, D, F, G). [5]

(ii) Reduce the above expression X (C, D, F, G) by using 4-variable Karnaugh map,

4
showing the various groups (i.e. octal, quads and pairs).
Draw the logic gate diagram for the reduced expression. Assume that the variables
and their complements are available as inputs. [5]