In this episode, we add one more tool to our Boolean algebra toolbox: DeMorgan’s Theorem. We then use it, along with some of our other tools, to modify an expression down to its simplest form.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:computer-organization-design-oer-1035 |
| Date | 01 January 2020 |
| Creators | Tarnoff, David |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Format | audio/mpeg |
| Source | Computer Organization and Design Fundamentals Series |
| Rights | http://creativecommons.org/licenses/by-nc-sa/4.0/ |
Page generated in 0.002 seconds