In this episode, we take a break from proving identities of Boolean algebra and start applying them. Why? Well, so we can build our Boolean logic circuits with fewer gates. That means they’ll be cheaper, smaller, and faster. That’s why.
For ease of adapting the materials, audio and transcripts are available to download.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Visit the author's website for more information.
Worksheet for this episode is available on the author's website. Please note that the worksheet is not under a Creative Commons License.
Computer Organization and Design Fundamentals Series was created as part of the East Tennessee State University’s Open Educational Resources (OERs) Awards Program.
Tarnoff, David, "Episode 4.09 - Simplification of Boolean Expressions" (2020). Computer Organization and Design Fundamentals Series. https://dc.etsu.edu/computer-organization-design-oer/2