Scribd
Upload
232 views

Problems: Cameron Hulse

This document discusses problems with digital circuits and boolean algebra expressions. It notes that truth tables and schematics take up too much space for complex circuits, truth tables hide circuit information, and schematics are difficult to use to determine outputs. Boolean expressions can optimize logic functions in software. Digital circuits with fewer gates result in cheaper circuitry, smaller boards, and lower power consumption.

Uploaded by

Cameron Hulse
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
232 views

Problems: Cameron Hulse

This document discusses problems with digital circuits and boolean algebra expressions. It notes that truth tables and schematics take up too much space for complex circuits, truth tables hide circuit information, and schematics are difficult to use to determine outputs. Boolean expressions can optimize logic functions in software. Digital circuits with fewer gates result in cheaper circuitry, smaller boards, and lower power consumption.

Uploaded by

Cameron Hulse
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Problems

Cameron Hulse

1. List three drawbacks of using truth tables or schematics for describing a digital
circuit.
a. Both schematics and truth tables take too much space to describe the operation
of complex circuits with numerous inputs.
b. The truth table "hides" circuit information.
c. The schematic diagram is difficult to use when trying to determine output values
for each input combination.
2. List three benefits of a digital circuit that uses fewer gates.
A lower gate count results in cheaper circuitry, smaller circuit boards, and lower
power consumption.
3. True or False: Boolean expressions can be used to optimize the logic functions in
software.
True
4. Convert the following boolean expressions to their schematic equivalents. Do not
modify the original expression

a.

b.

c.
Problems
Cameron Hulse

d.
5. Convert each of the digital circuits shown below to their corresponding boolean
expressions without simplification.
a. (̅A̅ + B) * ̅B̅ = X
b. (̅A̅ ̅*̅ ̅C̅) + (B * ̅C̅)
c. (A̅ + B) * (B̅ + A)
6. Apply DeMorgan's Theorem to each of the following expressions so that the NOT
bars do not span more than a single variable.
a. A̅ * C̅ * B̅
b. D̅ * (C̅ * B̅) * (A̅ * B̅)
c. A̅ * B * C̅ * A * B
7. Simplify each of the following expressions.
a. B * A + B
b. B * A̅
c. A + B̅ + C + A̅ + B̅
d. B̅ * A
e. A̅ * A
f. B̅ + A̅ + B̅ + C̅

You might also like