Chapter 10.3: Logic Gates. Based on Slides from Discrete Mathematical Structures: Theory and Applications and by Aaron Bloomfield. Learning Objectives.
Related searches for chapter 10.3: logic gates
Based on Slides from
Discrete Mathematical Structures:
Theory and Applications
and by Aaron Bloomfield
Draw a circuit diagram for = (xy' + x'y)z.
EXAMPLE 3, p. 714
Which Boolean expression is given by F?
F(x,y) = xy + x'y'
Draw a circuit for F,
i.e., a circuit to control two light switches.
A full adder is a circuit that accepts as input thee bits x, y, and c, and produces as output the binary sum cs of a, b, and c.
1 1 0 0
+ 1 1 1 0
It holds a single bit of memory.