Candidates should be able to:
- explain why data is represented in computer systems in binary form
- understand and produce simple logic diagrams using the operations NOT, AND and OR
- produce a truth table from a given logic diagram
Task 1: Prove the behaviour of each of the x3 logic gates using a simulator and writing the results into x3 truth tables.
Task 2: Create a 1-bit half adder and prove it works using a truth table.
Task 3: Create a 1-bit FULL adder (search online) and prove it works using a truth table.
Task 4: Combine multiple 1-bit full adders to add up x2 4-bit binary numbers. Prove it works.
A video explaining the need to be able to express logic in terms of:
- Logic diagram
- Logical expression
- Truth table
WTM: This is a walking talking mock through some typical Boolean Logic questions.