Combining Boolean operators using AND, OR and NOT

Logic gates can be combined to form more complex logic circuits and expressions. When combining gates, the order of precedence matters: brackets are evaluated first, then NOT, then AND, then OR. You need to be able to trace through circuits with multiple gates, building the truth table step by step.

Key points

• Definition:Logic Circuit: a combination of interconnected logic gates designed to produce a specific Boolean output.
• Multiple logic gates can be combined to create complex circuits.
• Order of precedence: Brackets > NOT > AND > OR.
• Example: B OR NOT C AND A is evaluated as B OR ((NOT C) AND A).
• When tracing a combined circuit, work through each gate's output step by step.
• Add intermediate columns to truth tables for the output of each gate.
• You should be able to write the Boolean expression from a logic circuit diagram.
• You should be able to draw a logic circuit from a Boolean expression.
• Exam Tip:When drawing a circuit for a 3-input expression like A AND NOT B AND C, you need a NOT gate for B and TWO AND gates (since AND gates have only 2 inputs). Chain them: e.g. (A AND NOT B) then that result AND C.
• Exam Example:P = NOT A AND (B OR C) → draw NOT gate on A, OR gate on B and C, then AND gate combining both outputs.
• Exam Example:P = (A OR B) AND NOT C → draw OR gate on A and B, NOT gate on C, then AND gate combining both outputs.