Scribd
Upload
67 views3 pages

Homework 3 (Mod1T3)

Uploaded by

Rodel Matute
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
67 views3 pages

Homework 3 (Mod1T3)

Uploaded by

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

NAME: Rodel Matute

YEAR & SECTION: IT2B

Boolean algebra is a useful and clever way to simplify digital circuits used in microprocessors. It can help
reduce the cost and raise the speed and efficiency of computers.

Digital circuits are made up of logic gates. Logic gates are a fundamental digital component that preform
simple logical calculations. All logic gates have at least one input and exactly one output and can only
take two states: 0 (no electrical current), and 1 (electrical current is present).

Multiple logic gates can be connected from output to input, forming complex pathways. When multiple
logic gates work together, they can preform complex mathematical calculations, as well as remember
data. They can be more than the sum of their parts.

There are seven logic gates:

AND gate

NAND gate

OR gate

NOR gate

XOR gate

XNOR gate

NOT gate

Each of these logic gates can preform its own unique logical operations and return an output state,
depending on the states of its inputs.

AND

Both inputs of the AND gate must be on in order for the output to be on. Otherwise, the output is off.
Hence, input A and input B must be on in order for the output to be on.
OR

The logic of the OR gate is just what you would expect. The output is only off if all of the inputs are off. If
at least one input is on, then the output is on.

NOT

The NOT gate is the simplest logic gate. It has only one input and one output. The output is always not
the input. For example, suppose the input of a NOT gate is on. Then the output of that same NOT gate
must be off. If the input is off, then the output is on.

NAND

The NAND gate is identical to an AND gate with a NOT gate attached to the output. The output is off if
and only if both inputs are on. Otherwise, if at least one input is off, then the output is on.

NOR

For the NOR gate, the output can only be on if both inputs are off. Otherwise, the output is off. Like the
NAND gate, the NOR gate is essentially an OR gate whose output is connected to a NOT gate.

XOR

The XOR (exclusive OR) gate is the “glorified” version of the OR gate. The output of the XOR gate is on if
and only if exactly one of the inputs is on. If both inputs are on, or if both inputs are off, then the output
is off.

XNOR

The XNOR gate is the inverted version of the XOR gate. Both inputs must hold the same state in order
for the output to be on.
Boolean algebra can be used to simplify logic circuits. Here's a simple example of a logic circuit that can
be simplified: A double-NOT. Everyone knows that if you invert something twice, then you get what you
started with. This fact can help save NOT gate money and decrease computing time.

Simplifying a double-NOT is just one of the things people can do with Boolean Algebra!

https://www.britannica.com/topic/Boolean-algebra

Alternate titles: complemented distributive lattice, complemented lattice


By The Editors of Encyclopaedia Britannica Last Updated: Sep 14, 2022

This article was most recently revised and updated by William L. Hosch.

You might also like