| S NO |
Assessment statement |
Grade |
Teacher’s notes |
| 1 |
Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR. |
|
LINK Introduction to programming, approved notation sheet. |
| 2 |
Construct truth tables using the above operators. |
|
For example, Maria won’t go to school if it is cold and raining or she has not done her homework. Not more than three inputs are used. LINK Thinking logically. TOK Reason as a way of knowing. |
| 3 |
Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates. |
|
Problems will be limited to an output dependent on no more than three inputs. The gate should be written as a circle with the name of the gate inside it. For example: OR LINK Thinking logically, connecting computational thinking and program design, introduction to programming. |
Print