We will briefly discuss lockdown drills

A1.2.4 Construct and analyse truth tables

A truth table is a complete, explicit map from every possible combination of Boolean input values (0 / 1 or F / T) to the corresponding output of a logical condition, expression or circuit. Because this map is exhaustive, it lets us predict, verify and simplify digital logic with mathematical certainty. Truth tables therefore sit at the centre of computer architecture, programming language semantics and formal reasoning.