Logic Gates

Marks:- 15%
Q1) Objective questions (1)
1) The output of gate is high only when both inputs are unequal, then the gate is -
EX-OR gate.
2) AND gate in positive logic is ---- gate in negative logic
OR.
3) Supply voltage for digital circuit is between 0V and – 5V. Then the high voltage
corresponds to ----
0V
4) A bubbled OR gate is ----
NAND gate (AND gate with bubbled at output).
5) --- gate is called as equality gate.
EX- NOR gate.
6 Inputs to EX-OR gate is A and 1. Corresponds output is -----
A
7) If the two inputs of OR gate are joined together, then corresponding output is
Same as input.
8) A  A is equal to ---- (M15)
0.
9) A number with odd parity is increased by 1. Then parity of the new number is
Even.
10) Bubbled NOR gate is equivalent to -----
AND.
11) When all inputs are low only the output is low this is the logic of ----
OR gate.
12) In --- gate if A =1, B= C then output Y = C
EX – OR gate.
13) The output of NAND gate is zero -----
When all inputs are one.
14 In Boolean Algebra A + A + A+ --- A is same as -----
A
15) The two inputs EX-OR gate are A•B +A•B then output of that EX-OR gate will
be ------
AB
16) Output of NOR gate is high when ----
All inputs are low.
17) An AND gate in positive logic becomes ---- gate in negative logic.
OR.
18) In ---- gate if A =1, B =C then output Y =C (M 01)
EX OR
19) The bubbled AND gate is equivalent to --- gate (O 01)
NOR
20) The output of NOR gate is when ---------- (O 03)
All inputs are low
21) According to absorptive law of Boolean algebra expression (A + AB) equals ----
A (M 04)
22) In Boolean algebra A  1 is always equal to ---- (M 05)
A
23) The output of NAND gate is zero ---- (M 06)
All inputs are high.
24) In negative logic system the more positive of two voltage levels is indicated by
0 (M 07)
25) An AND gate in positive logic becomes ---- gate in negative logic. (M 08)
OR
26) The gate ideally suited for bit comparison is ----- (O 08)
EX –OR gate.
27) In --- gate when one input is low output is high.
NAND
28) The number of input words in truth table always equals --- where n is number
of input bit.
2n
29) A controlled inverter is the logic circuit that transmit the binary number or its -
1`s compliment
30) NAND gate is equivalent to ---- gate.
Bubbled OR
31) A gate recognizes a word when its output is -----
High
32) If any one input goes low, output becomes high in ----- gate. (M12)
NAND
33) In Boolean Algebra A.A.A is equal to ----- (M13)
A
34) An OR gate in positive logic becomes ----- gate in negative logic. (O13)
AND
35) One of the inputs of AND gate is labeled as ENABLE. This control input is ---
Active high (M14)
36) For ---- gate when one of the input is high, output is low. (M16)
a) NAND, (b) NOR, (c) EX-OR, (d) OR
37) When one of the input of two input EX-OR gate is high it acts as ----- (M18)
a) NOT gate, (b) And gate, (c) OR gate, (d) NAND gate
Q1) Explain positive and negative logic. Write their appropriate voltage levels.
(4Marks = 1.5 Marks for Positive logic & 1.5Marks for Negative logic,
1 Marks for Voltage levels) (O 07)
Ans: - In digital circuits positive and negative logic can be used. In positive logic one
is represented by more positive of two voltage levels and 0 represent by other voltage
level. In negative logic 1 is represented by more negative of two voltage levels and 0
represented by other voltage level.
For example: - If two voltages are 0 V and 5 V, in positive logic 1 represented by
5V and 0 represented by 0 V, but in negative logic 1 is represented by 0 V and 0 is
represented by 5 V.
If two voltages are 0V and -5 V, in positive logic 1 is represented by 0V and 0 is
represented by -5V, while in negative logic 1 is represented by -5V and 0 is
represented by 0V.
In any digital circuit in case of positive logic voltage between 3.5V to 5V is
considered as 1while voltage between 1V to 0V is considered as 0.
Voltage Positive logic Negative logic

5V 1 - 0 -

0V 0 1 1 0

-5V - 0 - 1
Q2) State basic gates and draw their symbols. Write their truth table.
(M 01, 15, O 03, 06)
2) With the help of logical statement, equation, symbol, and truth table
explain basic gates. (M 17)
(3 Marks = 1 Mark for each gate)
Ans: - There are three types of basic gates.
A) AND gate: - AND gate is defined as gate which gives high output only when all
inputs are high
Boolean equation: - Y = AB = A AND B
Symbol: - Truth Table: -
A B Y
0 0 0
0 1 0
1 0 0
1 1 1
B) OR gate: - OR gate is defined as the gate which gives high output when any one
input is high.
Boolean equation: - Y = A+B = A OR B
Symbol: - Truth Table:-
A B Y
0 0 0
0 1 1
1 0 1
1 1 1
C) NOT gate: - NOT gate is also known as Inverter. The output of this gate is
compliment of input that means when input is high output is low and when input is
low output is high.
Boolean equation: - Y = A
Symbol: - Truth Table: -
A Y

0 1

1 0

Q3) State and prove De-Morgan’s theorem in digital electronics.

(O 02, 03,04,05,08, M 05, 07, 08, 09, 15, 16, 18)
(4 Marks = ½ Mark Statement, ½ mark for Proof, ½ mark for Diagram,
½ mark for Truth table for each Theorem)
Ans: - First theorem: - It state that “Compliment of sum equal to product of
compliment.”
OR
It also states that “Compliment of OR (addition) equals AND (product) of
compliment.”
OR
It also states that “NOR gate is equivalent to bubbled AND gate.”
Boolean equation for first theorem is A+B = A · B
Proof: - A+B = A · B
Case1:- A=B = 0
LHS:- A+B = 0+0 =0 = 1
RHS:- A · B = 0 · 0 = 1·1 = 1
Case 2:-A = 0, B = 1
LHS :- A+B = 0+1 = 1 = 0
RHS :- A · B = 0 · 1 =1·0 = 0
Case 3:-A = 1, B = 0
LHS :- A+B = 1+0= 1 = 0
RHS :- A · B = 1· 0 =0·1 = 0
Case 4:- A=B = 1
LHS:- A+B = 1+1 =1 = 0
RHS:- A · B = 1 · 1 = 0·0 = 0

Truth Table: -
LHS RHS

A B A+B A·B

0 0 1 1

0 1 0 0

1 0 0 0

1 1 0 0

Second theorem states that “Compliment of AND (product) is equal to OR

(addition) of compliment.”
OR
It also states, “The compliment of product is equal to sum of compliment.”
OR
It also state “NAND gate is equivalent to Bubbled OR gate.”
Boolean equation for second theorem is A·B = A + B
Proof: - A·B = A + B
Case1:-A =B =0
LHS:- A·B = 0·0 = 0 = 1
RHS = A + B = 0 + 0 = 1 + 1 = 1
Case 2:-A = 0, B = 1
LHS:- A·B = 0·1 = 0 = 1
RHS :- A + B = 0 +1 =1+0 = 1
Case 3:-A = 1, B = 0
LHS:- A·B = 1·0 = 0 = 1
RHS:- A + B = 1+ 0 =0+1 = 1
Case4:- A=B = 1
LHS:- A·B = 1·1 =1 = 0
RHS:- A +B = 1 + 1 = 0+0 = 0

Truth Table:-
LHS RHS

A B A·B A+B

0 0 1 1

0 1 1 1

1 0 1 1

1 1 0 0

Q4) Construct and explain EXOR gate by using basic gates. (M17)
Q4) Explain EX-OR gate. How it is constructed using basic gates? Write its
truth table. (M13)
(3 Marks = 1 Mark for Logic diagram, 1Marks for Truth table, 1Marks for Explanation)
Q4) Draw the logic symbol, truth table and logic equation of an XOR gate and
explain its working. (M 09, 10, 12, O 03, 08)
( 4 Marks = ½ Mark for Symbol, ½ Mark for Truth table, ½ Mark for Logic equation, ½
Mark for Diagram, 2 Mark for Explanation )
Q4) Define EX –OR gate. Draw its logic diagram using basic gates and explain.
(3 Marks = 1Marks for definition , 1 Mark for Logic diagram, 1Marks for explanation)
(M16)
Ans:- Logic symbol:-

Logic Equation:- Y = A•B + A•B

Circuit diagram:- Truth Table

A B Y
0 0 0
0 1 1
1 0 1
1 1 0
Explanation: - In this gate output is high when inputs are exclusive (not same).
When both inputs are low i.e. A = B = 0, the inputs of first AND gate are 0, 1,
while for second AND gate are 1, 0, hence the output of both AND gate is low i.e. 0.
Hence the output of OR gate is also low.
When inputs are A = 0 and B = 1 inputs of first AND gates are low while inputs
for second AND gates are high hence output of first AND gate is low but output of
second AND gate is high due to which output of OR gate is high.
When inputs are A = 1 and B = 0 inputs of first AND gates are high while inputs
for second AND gates are low hence output of first AND gate is high but output of
second AND gate is low due to which output of OR gate is high.
When both inputs are high A = B = 1 the inputs of first AND gate are 1, 0 while
for second AND gate are 0, 1 hence the output of both AND gate is low i.e. 0. Hence
the output of OR gate is also low.
From this we can conclude that when inputs are same output of EX-OR gate is
low, but When inputs are not same output is high.
Q5) Differentiate between inclusive and exclusive OR gate. (O 04, M17)
(3 Marks = 1 Mark for each difference)

Points Inclusive OR Gate Exclusive OR Gate

It is the gate which gives It is the gate which gives

high output when one of high output when inputs
Definition the input becomes high are not same (Odd
numbers of input)

Boolean Equation Y = A+B Y= AB = A·B + A·B

Logic Symbol

Truth Table A B Y
A B Y
0 0 0 0 0 0
0 1 1 0 1 1
1 0 1 1 0 1
1 1 1 1 1 0

Logic IC IC7432 Quad dual input IC7486 Quad dual input

OR gate EX-OR gate

It is Basic gate It is Derived gate

Q6) What is universal building block? Explain NOR gate as universal building
block. (M 02, 03, 07, 08, 09, 11, 18, O 06)
(4 Marks = 1 Mark for Statement, 3 Marks for Construction of Basic Gates)
Ans: - NOR and NAND gate are known as Universal building blocks because these
gates are used to build all basic gates i.e. AND, OR, NOT, Derived gates like NAND,
EX-OR, EXNOR, Flip Flop etc.
A) NOR as NOT: - In NOR gate when both inputs are connected to low logic (0)
output becomes high (1), and both inputs are connected to high logic (1) output is
low (0). The above principal is used to construct NOT gate.
To construct NOT gate the input terminals are connected to each other to get
only single input terminal. The output is now complimented of input.
Truth Table :-
A Y

0 1

1 0

B) NOR as OR: - NOR gate is inversion of OR gate. If one more NOT gate is connected
in the output circuitry the resultant gate is nothing but OR gate. But in this case
NOR as NOT gate is used in the output circuitry
Truth Table :-
A B Y
0 0 0
0 1 1
1 0 1
1 1 1
C) NOR as AND: - As De`Morgans second theorem states that “Bubbled OR gate
is equivalent of NAND gate” this statement is used to construct NOR as AND gate.
To construct bubbled OR gate two NOT gates by using NOR gates are connected
before NOR gate and one more NOT gate is connected in the output circuitry. But as
we require AND gate this last NOT gate which is connected in the output circuitry
should not be connected.
Truth Table :-

A B Y
0 0 0
0 1 0
1 0 0
1 1 1
Q7) With the help of logical statement, logical equation, symbol and truth
table explain NAND gate. (M 17)
(3 Marks = 1/2 Mark for each points, 1 mark for explanation)

Q7) Define NAND gate. Draw logic diagram of basic gates using NAND gates.
Q7) Explain how NAND gate is used as universal building block.
Q7)) Why NAND gate is called Universal Building Block? Construct basic gates
using NAND gate. (M 06, 09, 13, 16, O 01, 02, 03, 05)
(4 Marks = 1 Mark for Statement, 3 Marks for Construction of Basic Gates)
Ans: - NAND gate is defined as the gate which gives high output only when one of
the inputs is low.
1) Definition/ logical statement: -NAND gate is defined as ‘the gate which gives high
output when any one input is low.’
2) Boolean equation: - Y = A • B
3) Symbol: -

4) Truth Table: -
A B Y
0 0 1
0 1 1
1 0 1
1 1 0
It is a AND gate with inverter. That means it is combination of AND gate and NOT gate.
Output of this gate is high when its anyone input becomes low.
NAND gate is also known as universal building block because these gates are
used to build all basic gates i.e. AND, OR, NOT, Derived gates like NAND, EX-OR
EXNOR, Flip Flop etc.
A) NAND as NOT gate: - In NAND gate when both inputs are connected to low
logic (0) output becomes high (1), and both inputs are connected to high logic (1)
output is low (0). The above principal is used to construct NOT gate.
To construct NOT gate the input terminals are connected to each other to get
only single input terminal. The output is now complimented of input.
Truth Table:-

A Y

0 1

1 0

B) NAND as AND: - NAND gate is inversion of AND gate. If one more NOT gate is
connected in the output circuitry the resultant gate is nothing but OR gate. But in
this case NAND as NOT gate is used in the output circuitry.
Truth Table: -

A B Y
0 0 0
0 1 0
1 0 0
1 1 1
C) NAND as OR: - As De`Morgans First theorem states that “Bubbled AND gate is
equivalent of NOR gate” this statement is used to construct NAND as OR gate.
To construct bubbled AND gate two NOT gates by using NAND gates are
connected before NAND gate and one more NOT gate is connected in the output
circuitry. But as we require OR gate this last NOT gate which is connected in the
output circuitry should not be connected.
 Truth Table:-

A B Y
0 0 0
0 1 1
1 0 1
1 1 1

Q8) Explain the working of 3- bit parity checker. (M 02, 11, O 08)
(3 Marks = ½ Mark for Logic diagram, ½ Marks for Truth table, 2Marks for Explanation)
Ans: - In many applications large quantity of binary data is transferred from one
place to another. But due to some reason some bit gets changed i.e.0 to 1 or 1 to 0
and there will be error in data. Presence of such error is detected with the help of
parity checker.
Parity is an information related to numbers of 1`s. If binary number contains odd
numbers of 1 parity of number is odd and output of parity checker becomes high. If
number of 1 is even, then the parity is even and output of parity checker is low.
Truth Table:-
A B C Y Parity

0 0 0 0 Even

0 0 1 1 Odd

0 1 0 1 Odd

0 1 1 0 Even

1 0 0 1 Odd

1 0 1 0 Even

1 1 0 0 Even

1 1 1 1 Odd

Q9) Explain working of EX-OR gate as 4- bit parity checker. (M15)

(3 Marks = ½ Mark for Logic diagram, ½ Marks for Truth table, 2Marks for Explanation)
Ans: In many applications large quantity of binary data is transferred from one place
to another. But due to some reason some bit gets changed i.e.0 to 1 or 1 to 0 and
there will be error in data. Presence of such error is detected with the help of parity
checker.
Parity is an information related to numbers of 1`s. If binary number contains odd
numbers of 1 parity of number is odd and output of parity checker becomes high. If
number of 1 is even, then the parity is even, and output of parity checker is low.
 Truth Table: -
A B C D Y Parity

0 0 0 0 0 Even

0 0 0 1 1 Odd

0 0 1 0 1 Odd

0 0 1 1 0 Even

0 1 0 0 1 Odd

0 1 0 1 0 Even

0 1 1 0 0 Even

0 1 1 1 1 Odd

1 0 0 0 1 Odd

1 0 0 1 0 Even

1 0 1 0 0 Even

1 0 1 1 1 Odd

1 1 0 0 0 Even

1 1 0 1 1 Odd

1 1 1 0 1 Odd

1 1 1 1 0 Even

Q10) What is half adder? Explain its working with logic diagram and truth table.
(O 02, 04, M 01, 13)
(4 Marks = 1 Mark for definition, ½ Mark for Logic diagram, ½ Marks for Truth table, 2Marks
for Explanation)
Q10) Draw logic diagram of Half Adder. Explain it with the help of equation
and truth table. (O 13)
(3 Marks = 1 Mark for Logic diagram, 1 Marks for Truth table, 1Marks for Explanation with
equation)
Ans: - Half adder is the circuit used for addition of two-bit binary numbers. The
outputs of half adder are divided into two parts i.e. Sum and Carry.
The Boolean equation for sum is given as Y = A  B, while Boolean equation
for carry is given as Y = A  B
From the Boolean equation it is clear that to construct logic circuit of half adder
two gates are required, for sum EX-OR gate and for carry AND gates are required.
Logic Diagram: - Truth Table: -
A B Carry Sum

0 0 0 0

0 1 0 1

1 0 0 1

1 1 1 0
Case1) A = B = 0
When both A and B are low then the output of EX-OR and AND gates are low
i.e. sum and carry both are low.
Case2) A = 0 and B = 1
In this case output of EX-OR gate is high while output of AND gate is low i.e.
sum is high (1) and carry is low (0)
Case3) A = 1 and B = 0
In this case also output of EX-OR gate is high while output of AND gate is low
i.e. sum is high (1) and carry is low (0)
Case 4) A = B = 1
When both A and B are high then the output of EX-OR gate is low and output
of AND gate is high i.e. sum is low (0) and carry is high (1).
Q11) Explain working of Full Adder with necessary logic diagram and truth
table. (M 02,05,07,08, 11, 13, O 05, 06, 09)
(4 Marks = 1 Mark for definition, ½ Mark for Logic diagram, ½ Marks for Truth table, 2Marks
for Explanation)
Q11) What is Full Adder? Explain working of Full Adder with the help of logic
diagram truth table and equation. (O 13, M14,
15)
(4 Marks = 1 Mark for definition, 1 Mark for Logic diagram, 1 Marks for Truth table, 1Marks
for Explanation with equation)
Ans: - Half adder is used to add two bits. To overcome this drawback full adder is
used. Full adder can be used to add three bits. It also has sum and carry outputs.
The Boolean equation for carry is Y = A  B + A  C + B  C, while Boolean equation
for sum is Y = A  B  C
From this equation it is clear that to construct logic circuit of full adder three
gates are required, for sum three-bit EX-OR (2 two-bit EX-OR) gate and for carry
three two bit AND gates and one three bit OR (2 two bit OR) gate are required.
Logic Diagram:- Truth Table:-

A B C Carry Sum

0 0 0 0 0

0 0 1 0 1

0 1 0 0 1

0 1 1 1 0

1 0 0 0 1
 1 0 1 1 0

1 1 0 1 0

1 1 1 1 1

If all inputs are low, both sum and carry are low.
If two inputs are low and one input is high, output of EX-OR gate is high while
output of OR gate is low i.e. sum is one and carry is low.
If two inputs are high and one input is low output of EX-OR gate is low while
output of OR gate is high i.e. sum is low and carry is high.
If all inputs are high both sum and carry are high.

Q12) Draw the logic diagram of controlled inverter and explain its working.
(M 01, 03, O 01)
Q12) Explain working of 4- bit controlled inverter with neat logic diagram.
(M 12)
(3 Marks = ½ Mark for Logic diagram, ½ Marks for Truth table,
2 Marks for Explanation)
Ans: - EX-OR gate is used as controlled inverter. In this case one input of EXOR gate
is connected to +Vcc (high logic) and other input is connected to input signal which
may be either 0 or 1.
If input A is low (0) inputs of EXOR gate are 0 1 hence output of EXOR gate is
high (1) which is compliment of input.
If input A is high (1) inputs of EXOR gate are 1 1 hence output of EXOR gate
becomes low (0) which is again compliment of input.
Thus, this circuit works as inverter. The working of this circuit is controlled by
input terminal connected to high level. If this input is connected to low level output
of EXOR gate is same as input hence this circuit is known as control inverter.
Truth Table :-

A B Y
0 0 0
1 0 1
0 1 1
4 bit controlled inverter: - 1 1 0

In this case one input of EX-OR gate is connected to common line which is
connected to +Vcc to get high input. The other inputs are connected to input signal.
If inputs are A3, A2, A1, A0 then outputs are A3, A2, A1, A0.
For example, if inputs are A3, A2, A1, A0 = 1010 then outputs are
A3, A2, A1, A0 = 0101.
Q13) Explain 4-bit binary adder. (O 01, 08, M 05, 06, 09)
(3 Marks = ½ Mark for Logic diagram, 2Marks for Explanation,
½ Marks for Example)
Ans: - To add four-bit binary numbers above arrangement is used. In first column
there is no carry and only two bits are added hence half adder is used. The carry of
first adder is added to second, the carry of second adder is added to third and so on.
As there are additions of three bits full adders are required.

If inputs are A3 A2 A1 A0 and B3 B2 B1 B0 then we get

A3 A2 A1 A0
+ B3 B2 B1 B0
C S3 S2 S1 S0
For example:- 1101 + 1010
1101
+ 1010
10111
As EAC is present answer is positive
(111011)2 – (101)2 = (110110)2

Q14) Draw circuit of four-bit binary adder – subtractor and explain its working.
(O 07,13, M 03, 10, 11, 12)
(4 Marks = ½ Mark for each Logic diagram, 1Marks for each Explanation,
½ Marks for each Example)
Ans: - The above circuit is used for addition as well as for subtraction of two
numbers. In this circuit four EX-OR gates are used in form of control inverter. Its
common input terminal is known as SUB input. This input terminal is also connected
to first block which is also full adder.
If SUB input is low the second inputs B3 B2 B1 B0 passes through EX-OR gate and
applied to full adder. The circuit now performs the addition of two numbers A3 A2 A1
A0 and B3 B2 B1 B0
A3 A2 A1 A0
+ B3 B2 B1 B0
C S3 S2 S1 S0
For example:- 1101 + 1010
1111
1101
+ 1011
11000
1101 + 1010 = 11000
To perform subtraction SUB input must be high due to which output of EX OR
gate is compliment of second number (subtrahend) i.e. B3 B2 B1 B0. As subtrahend
input is high in first column 1 is added to get 2`s compliment of subtrahend. Now
the new inputs for full adder are A3 A2 A1 A0, B3 B2 B1 B0 and 1
In this case as 1 is added in the first column principle of 2`s compliment is used
hence if end around carry is present disregard it in the answer.

For example, 1101 - 1010

1101
- 1010 2`s compliment 0110

1
1101
+ 0110
10011
As EAC is present answer is positive hence disregard EAC and remaining bits gives
final answer.
1101 – 1010 = 0011
Q15) Prove the following identities using Boolean laws. (M 02)
(3 Marks = 1½ Mark for each Equation)

Q16) Using Boolean Algebra verify (M 05, 18, O 04)

(3 Marks = 1½ Mark for each Equation)

a) ( A + B) (A + C) = A+ BC
b) A B C + A B C + A B C = A (B + C)
Sol: - a) ( A + B) (A + C) = A+ BC
LHS = ( A + B) (A + C)
= A. A + A. C + A. B + B. C
= A + A. C + A. B + B. C -------- A. A = A
= A( 1+ C) + A. B + B. C --------1 + C = 1
= A + A. B + B. C
= A( 1 + B) + B. C --------1 + B = 1
= A + B. C
= RHS
b) A B C + A B C + A B C = A(B + C)
For answer refer question no 15.
Q17) Using Boolean Algebra verify (M 04)
(4 Marks = 2 Mark for each Equation)

Q18) Simplify the following expression using Boolean Laws. (M 07)

a) Y = AB + A (B+C) +B (B+C)
b) Y = (A + B) (A + C)
(3 Marks = 1½ Mark for each Equation)
Sol: - a) Y = AB + A (B+C) +B (B+C)
= AB + AB + AC + BB + BC --------BB = B, AB + AB = AB
= AB + AC + B + BC
= AB + AC + B (1 +C) -------1 + C = 1
= AB + AC + B
= B( A +1) + AC --------- A + 1 =1
= B + AC
Q19) Prove the following identities using Boolean laws. (O 02, 03)
(3 Marks = 1½ Mark for each Equation)

Q20) Show that (A + C) (A + D)(B + C) ( B + D) = AB + CD

(4 Marks)
Sol:- (A + C) (A + D)(B + C) ( B + D) = AB + CD
LHS = (A + C) (A + D)(B + C) ( B + D)
= (A.A + A.D + A.C + C.D).( B.B + B.D + B.C + C.D)
= (A + A.D + A.C + C.D). (B + B.D + B.C + C.D) ----- A.A = A
= (A (1 + D) + A.C + C.D). (B (1+D) + B.C + C.D) ------1 + D= 1
= (A + A.C + C.D). (B + B.C + C.D)
= (A (1 + C) + C.D). (B (1+ C) + C.D) ---- 1+C =1
= (A + C.D). (B + C.D)
= A.B + A.C.D + B.C.D + C.D + C.D -------C.D + C.D = C.D
= A.B + A.C.D + B.C.D + C.D
= A.B + A.C.D + C.D (1 + B) ------- 1 + B = 1
= A.B + A.C.D + C.D
= A.B + C.D( A +1) ----A + 1 = 1
= A.B + C.D
= RHS
Q21) Simplify the following expression using Boolean Laws. (M 07)
a) Y = AB + A (B+C) +B (B+C)
b) Y = (A + B) (A + C)
(3 Marks = 1½ Mark for each Equation)
Sol:- a) Y = AB + A (B+C) +B (B+C)
= AB + AB + AC + BB + BC --------BB = B, AB + AB = AB
= AB + AC + B + BC
= AB + AC + B (1 +C) -------1 + C = 1
= AB + AC + B
= B( A +1) + AC --------- A + 1 =1
= B + AC

Q22) Show that by using Boolean algebra and De`Morgans Theorem. (O 08)
a) B. C + D. A. C + D. A. B. C + D. B. C = C
b) A. (A + C) (A. B + C) = 0
(3 Marks = 1½ Mark for each Equation)
Q23) Draw the logic diagram for following Boolean expression using basic
gates and write its truth table. (M 01)
Y = A. B + B. C + A. C + A. B. C
(4 Marks = 2 Marks for Diagram,2 Marks for Truth table))
Ans:-

A B C A.B B.C A.C A.B.C Y

0 0 0 0 0 0 0 0
0 0 1 0 0 1 0 1
0 1 0 0 1 0 0 1
0 1 1 0 0 1 0 1
1 0 0 1 0 0 0 1
1 0 1 1 0 0 0 1
1 1 0 0 1 0 0 1
1 1 1 0 0 0 1 1

Q 24) Draw the logic diagram for Boolean expression

Y = (A + B). (A + B), Also write truth table. (M 03)

(3 Marks = 1½Marks for Diagram, 1½ Marks for Truth table)
Ans:- Logic Diagram:-
Truth Table:-

A B A B A+B A+B Y
0 0 1 1 1 1 1

0 1 1 0 1 0 0

1 0 0 1 0 1 0

1 1 0 0 1 1 1

Q25) Draw logic diagram for the Boolean expression Y = (A + B). (A. B).
Write the truth table and name the gates used. (M 05, 18)
(3 Marks = 1 Mark for Diagram,1 Mark for Truth table,1 Mark for name of gates)
Ans:- Gates used in this circuit are 1) OR gate, 2) NAND gate, 3) AND gate.

Truth Table:-

A B A+B A.B Y
0 0 0 1 1

0 1 1 1 1

1 0 1 1 1

1 1 1 0 0
Q26) What logic operation is performed by the following circuit. Prove by
using De-Morgan’s Theorem. (M 04)
(4Marks)

Ans:-

Q27) Draw logic circuit for following situation. Red lamp glows when none of
three inputs are present. Green lamp glows when only two of three inputs are
present and Yellow lamp glows when all three are present. (O 05)
(3 Marks = 1 Mark for each output)
Ans:- 1) Red lamp glows when none of the three inputs are present this happens
only in case of NOR gate, hence NOR gate is used.
2) Green lamp glows only when two of three inputs are present this happens only
in case of EX- NOR gate.
3) Yellow lamp glows when all three inputs are present this happens in case of
AND gate.
Hence in this case NOR, EX – NOR and AND gates are used.
Q28) Draw logic diagram for the following expression and write truth table for
the same.
Y = (A. B+ A. B) + A. B (O 09)
(3 Marks = 2 Mark for Logic diagram, 1 Marks Truth table)
Ans:-

Truth Table:-

A B A B A.B A.B A.B + A.B Y

0 0 1 1 0 1 1 0
0 1 1 0 0 0 0 1
1 0 0 1 0 0 0 1
1 1 0 0 1 0 1 0

Q29) Prove the following using laws of Boolean algebra. (M12)

(3 Marks = 1½ Mark for each Equation)

Sol:- a)

b)
Q30) Draw logic diagram for the Boolean expression, Write its truth table.
Y = (A • B • C) + (A • B • C) (M13)
(4 Marks = 2 Mark for Logic diagram, 2 Marks Truth table)
Ans:-

Truth Table:-

A B C B C Y = ( A • B • C) + ( A • B • C)
0 0 0 1 1 0

0 0 1 1 0 0

0 1 0 0 1 0

0 1 1 0 0 0

1 0 0 1 1 0

1 0 1 1 0 1

1 1 0 0 1 1

1 1 1 0 0 0

Q31) Design a logic circuit such that output is high (Logic 1) when
a) A = 1, B = 0, C = 0, (b) A = 0, B = 1, C = 0, (c) A = 1, B = 1, C = 0 (O13)
Ans:- To design the logic circuit for the given condition the following equation is used
Y = A B C +A B C +A B C
Y = C (A B + A B + A B)
Y = C  A (B + B) + A B
Y = C (A + A B) ------------------ B + B = 1
Y = C (A + B) ------------------ A + A B = A + B

Q32) When two input EX-OR gates are AB + AB, then prove that its output
remains equal to AB. (use of Boolean Algebra) (M14)
Ans:- Let consider the inputs applied to EX-OR gate are X and Y
Where X = A B and Y = A B
Output of gate becomes Q = X  Y
Q=XY+XY
 By substituting the value of X and Y in the above equation we get.

=AB
Q33) Draw logic diagram for Boolean equation and write its truth table. (M14)

Y = A·B +BC + AB + ABC

(3 Marks = 1½Mark for Logic diagram, 1½ Marks Truth table)
Ans:- Logic Diagram:

Truth Table :-

A B C A B AB BC AC ABC Y

0 0 0 1 1 1 0 0 0 0
0 0 1 1 1 1 1 1 0 1
0 1 0 1 0 1 0 0 0 0
0 1 1 1 0 1 0 1 0 1
1 0 0 0 1 1 0 0 0 0
1 0 1 0 1 1 1 0 1 1
1 1 0 0 0 0 0 0 0 0
1 1 1 0 0 0 0 0 0 0
Q34) Draw logic diagram and write output equation in Boolean form using logic
gates for following condition:
A red led should glow when any two of the three operations are taking
place and green led should glow when all three operations are carried out.
(M14)
Ans:- Logic equation for given conditions are
A) For Red LED output equation is
Y1 = AB + AC + BC
B) For Green LED output equation is
Y2 = ABC
Logic Diagram:

Q35) Draw the logic diagram for given logic expression and simplify: (M16)

Ans: - Logic Diagram

--------------------------------------------- --------------------------------------------