Computer Science

Senior High

Preview

Imagine describing the rule for a school gate alarm in words: "The alarm rings if the gate is open and it is after 10 pm, or if someone breaks the glass." That sentence is clear, but long. Engineers need a shorter, exact way to write such rules, so they can check them and build circuits from them. That shorter way is a Boolean expression. This note shows how to write Boolean expressions and how to use them to make circuits smaller and more reliable.

Notes5

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.

Boolean Expressions and Simplifying Circuits (Computer Science) · TudHub