EXPERIMENT 3

AIM: Implementation of Boolean Logic Functions using logic gates and combinational
circuits.
𝑄 ( 𝐴 , 𝐵 , 𝐶 ) = 𝑨 𝑩 + 𝑨 ( �̅ �̅ + �̅ �̅ )

Virtual Lab Link:

Welcome to Virtual Labs - A MHRD Govt of india Initiative (vlabs.ac.in)
Online Circuit Simulator Link:
https://www.deldsim.com/simulator/

Truth Table of given Boolean Equation

A B C AB __ ___
BC A(BC) Y
0000
1 0 0
0010
1 1 0 0
0100
0 0 0
0110
1 0 0
1000
1 1 1
1010
1 1 1
1101
0 1 1
1111
0 1

Circuit Diagram:

nd
Digital Electronics (01EC0102) 2 Semester page no
 Procedure:

Connect Gates: Connect the gates according to the expression.

• Use an AND gate for the term AB.
• Use a NOT gate to negate B and C (B' and C').
• Use an OR gate to combine A with the result of B' + C'.
• Finally, connect the outputs of the AND gate and the OR gate to get the desired output .

Test the Circuit: Verify the circuit's functionality by applying different input combinations
and observing the output.
Paste your simulation result screen shot here:

Conclusion:

The experiment successfully demonstrated the implementation of Boolean logic functions

using logic gates and combinational circuits, showcasing the fundamental principles of

digital electronics and their practical applications in computing and engineering.

nd
Digital Electronics (01EC0102) 2 Semester page no
Post Lab

1. Convert the following SOP expression to an equivalent POS expression.

A.

B.

C.

D.
2.
Determine the values of A, B, C, and D that make the sum term equal to zero.
A. A = 1, B = 0, C = 0, D = 0

B. A = 1, B = 0, C = 1, D = 0

C. A = 0, B = 1, C = 0, D = 0

D. A = 1, B = 0, C = 1, D = 1
3. Derive the Boolean expression for the logic circuit shown below:

A.

B.

C.

D.
4. From the truth table below, determine the standard SOP expression.

A.

nd
Digital Electronics (01EC0102) 2 Semester page no
B.
C.

D.
5.
One of De Morgan's theorems states that. Simply stated, this means that logically there
is no difference between:
A. a NOR and an AND gate with inverted inputs
B. a NAND and an OR gate with inverted inputs

C. an AND and a NOR gate with inverted inputs

D. a NOR and a NAND gate with inverted inputs

6.
Applying DE Morgan’s theorem to the expression, we get ________.
A.

B.

C.

D.
7. The systematic reduction of logic circuits is accomplished by:
A. using Boolean algebra

B. symbolic reduction

C. TTL logic

D. using a truth table

8. Which output expression might indicate a product-of-sums circuit construction?
A.

B.

C.

D.
9.
For the SOP expression, how many 1s are in the truth table's output column?
A. 1

B. 2

C. 3

D. 5
10.
A truth table for the SOP expression has how many input combinations?
A. 1

nd
Digital Electronics (01EC0102) 2 Semester page no
 B. 2

C. 4

D 8

Sign:

Date:

nd
Digital Electronics (01EC0102) 2 Semester page no