Return to search

Episode 4.09 - Simplification of Boolean Expressions

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.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:computer-organization-design-oer-1001
Date01 January 2020
CreatorsTarnoff, David
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
Formataudio/mpeg
SourceComputer Organization and Design Fundamentals Series
Rightshttp://creativecommons.org/licenses/by-nc-nd/4.0/

Page generated in 0.0019 seconds