Boolean Expressions and Simplifying Circuits

Topic: Y2-3 Boolean expressions and simplifying circuits

How to write logic circuits as Boolean expressions and make them simpler, explained step by step: notation, the identity law, De Morgan's laws, DNF and CNF, then optimising circuits, universal gates and fault-tolerant designs.

View resource Free to join

More on Boolean expressions and simplifying circuits

Other resources you can find on TudHub.