Chapter 10.3: Logic Gates. Based on Slides from Discrete Mathematical Structures: Theory and Applications and by Aaron Bloomfield. Learning Objectives.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Based on Slides from
Discrete Mathematical Structures:
Theory and Applications
and by Aaron Bloomfield
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.