Loading...

Media is loading
 

Description

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.

Adapting Materials

For ease of adapting the materials, audio and transcripts are available to download.

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Author's Website

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.

Acknowledgements

Computer Organization and Design Fundamentals Series was created as part of the East Tennessee State University’s Open Educational Resources (OERs) Awards Program.

Episode-4.09-Transcript.pdf (82 kB)
Episode 4.09 – Simplification of Boolean Expressions Transcript in PDF

Episode-4.09-Transcript.docx (15 kB)
Episode 4.09 – Simplification of Boolean Expressions Transcript in Word

Share

COinS