Lecture 4 Objectives
At the end of today's class you should
KNOW:
- The symbols used to represent AND, OR, and NOT gates in a digital
logic diagram
- The "sum of products" form of a Boolean expression
BE ABLE TO:
- Draw a digital circuit diagram (logic diagram) from a
truth table (and vice versa)
Sample Exam Question:
Draw a circuit diagram for the Boolean function F defined by
this truth table:
A B C | F
--------------
0 0 0 | 1
0 0 1 | 1
0 1 0 | 0
0 1 1 | 0
1 0 0 | 0
1 0 1 | 1
1 1 0 | 0
1 1 1 | 1