Topic Wise Solved Problems Question – Computer Sir Ki Class

SUB-BOOL:Exam Questions:

06B-2017 2

Draw the Logic Circuit of the following Boolean Expression using only NAND Gates:
X.Y + Y.Z

CBSE12D-2017

C06C-2017 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
CBSE12D-2017

C06D-2017 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)

CBSE12D-2017

C06A 2

State any one Absorption Law of Boolean Algebra and verify it using truth table.

CBSE12A-2018

C06B 2

Draw the Logic Circuit of the following Boolean Expression:
(U’+V).(V’+W’)

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
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)

CBSE12A-2018

C06A 2

State DeMorgan’s Laws of Boolean Algebra and verify them using truth table.

CBSE12A-2017

C06B 2

Draw the Logic Circuit of the following Boolean Expression using only NOR Gates:
( A+B).(C+D)

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
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)

CBSE12A-2017

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

CBSE12A-2016

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

C06B 2

Write the Boolean Expression for the result of the Logic Circuit as shown below:

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
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)

CBSE12A-2016

C06C-2015 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
CBSE12A-2015

C06D-2015 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)

CBSE12A-2015