Chapter 11 – TheWorksheets.CoM

Chapter 11 Boolean Algebra 11 BOOLEAN ALGEBRA - CIMT

These three gates, NOT, AND and OR, can be joined together to form combinatorial circuits to represent Boolean expressions, as explained in the previous chapter. Example Use logic gates to represent (a) ~ p∨q (b) ()x∨y∧~x Draw up the truth table for each circuit Solution (a) pq~p ~ p∨q 001 1 011 1 100 0 110 1 (b) xy x ∨y ~x (x ∨y ...