Scribd
Upload
784 views

CNIT 176 Lab Boolean Algebra 1

This document describes a Boolean algebra lab involving three-input AND gates, AND, OR, and NOT gates to form logical equivalents like NAND and NOR gates, and how their truth tables relate to DeMorgan's Law. It also discusses using two NOT gates as a non-inverting buffer and how the double negation law explains why it works.

Uploaded by

Manas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
784 views

CNIT 176 Lab Boolean Algebra 1

This document describes a Boolean algebra lab involving three-input AND gates, AND, OR, and NOT gates to form logical equivalents like NAND and NOR gates, and how their truth tables relate to DeMorgan's Law. It also discusses using two NOT gates as a non-inverting buffer and how the double negation law explains why it works.

Uploaded by

Manas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

CNIT 176

Boolean Algebra Lab part one

Three input AND gates with two AND gates

Three input truth table


AND and NOT gate

AND and NOT gate truth table


AND,OR, and Not gates to form the logical eqivalancy of the NAND gate

AND,OR, and Not truth table


OR gate and a Not gate to form the logical equivalency of a NOR gate

OR gate and a Not gate truth table


OR,AND, and NOT gate to create the logical equivalency of a NOR gate

OR,AND, and NOT gate truth table

How do the results you found relate to DeMorgan’s Law? Answer clearly in your report.

DeMorgan’s law states how opposites can become equals through negation. This concept relates to the
assignment because of how we used the AND along with the NOT gate to create the NAND gate. The
NAND and AND gates are logical opposites. With the use of AND and NOT we can use DeMorgan’s law to
inverse the inputs to make AND and NAND logical equivalents.
Two Not gates used to create a non-inverting buffer

Two
NOT gates truth table

Which of the Boolean laws can be used to explain why your circuit works as a non-inverting
buffer. Explain your answer.

One of the Boolean laws that can be used to explain why the circuit works as a non-inverting buffer is
the double negation law. The double negation law says that a double component of the variable is equal
to the variable. So when the input was placed through two NOT gates the input was reversed once to
make it the opposite and then reversed again to make it the same.

You might also like