2.1.11 Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR.

2.1.12 Construct truth tables using the above operators.

2.1.13 Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates.

4.1.4 Identify when decision-making is required in a specified situation.

4.1.5 Identify the decisions required for the solution to a specified problem.

4.1.6 Identify the condition associated with a given decision in a specified problem.

4.1.7 Explain the relationship between the decisions and conditions of a system.

4.1.8 Deduce logical rules for real-world situations.

4.2.8 Deduce the efficiency of an algorithm in the context of its use.

4.2.9 Determine the number of times a step in an algorithm will be performed for given input data.

4.3.7 Define the operators =,≠, <, <=, >, >=, mod, div.

4.3.9 Construct algorithms using loops, branching.

D.3.7 Construct code examples related to repetition statements.

D.4.12 Trace algorithms using the implementations described in assessment statements