Questions – Exam Papers – Computer Sir Ki Class

Question Typewise Collection-"Derivations" Questions - Exam Papers (CPP) No. of Q.12
Q.1   Exam - CBSE12D-2017/C06D/3

Reduce the following Boolean Expression to its simplest form using K-Map:
F(X,Y,Z,W)= Σ (0,1,2,3,4,5,10,11,14)

Q.2   Exam - CBSE12D-2017/C06C/1

Derive a Canonical SOP expression for a Boolean function F, represented by the following truth table:

U V W F(U,V,W)
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 0

Q.3   Exam - CBSE12A-2015/C06D/3

Reduce the following Boolean Expression to its simplest form using K-Map :
F(X,Y,Z,W) = ∑(0,1,4,5,6,7,8,9,11,15)

Q.4   Exam - CBSE12A-2015/C06C/1

Derive a Canonical POS expression for a Boolean function F, represented by the following truth table:

P Q R F(P,Q,R)
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

Q.5   Exam - CBSE12A-2015/C06A/2

Verify the following using Boolean Laws.
U’+ V= U’V’+U’.V +U.V

Q.6   Exam - CBSE12A-2017/C06D/3

Reduce the following Boolean expression to its simplest form using K-Map:
E(U,V,Z,W)= Ó (2,3,6,8,9,10,11,12,13)

Q.7   Exam - CBSE12A-2017/C06C/1

Derive a Canonical POS expression for a Boolean function G, represented by the following truth table:

X Y Z G(X,Y,Z)
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

Q.8   Exam - CBSE12A-2018/C06D/3

Reduce the following Boolean Expression to its simplest form using K-Map:

G(U,V,W,Z) = Σ (3,5,6,7,11,12,13,15)

Q.9   Exam - CBSE12A-2018/C06C/1

Derive a Canonical POS expression for a Boolean function FN, represented by the following truth table:

X Y Z FN(X,Y,Z)
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

Q.10   Exam - CBSE12A-2016/C06D/3

Reduce the following Boolean Expression to its simplest form using K-Map:
F(P,Q,R,S)= Σ(0,4,5,8,9,10,11,12,13,15)

Q.11   Exam - CBSE12A-2016/C06C/1

Derive a Canonical SOP expression for a Boolean function G, represented by the following truth table:

A B C G(A,B,C)
0 0 0 1
0 0 1 0
0 1 0 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

Q.12   Exam - CBSE12A-2016/C06A/2

Verify the following using Boolean Laws.
X’+ Y’Z = X’.Y’.Z’+ X’.Y.Z’+ X’Y.Z+ X’.Y’.Z+ X.Y’.Z

LHS X’ + Y’.Z = X’.(Y + Y’).(Z + Z’) + (X + X’).Y’.Z

×