Logic and algorithms
Chapter 30 of 8 strong
RESTS ONDistinguish number-system containment and justify closure or counterexamplesCH 1Distinguish an element statement from a subset statement and decide whether a finite set is contained in another stated setCH 1Form or recognise the union, intersection, difference and complement of finite or interval-defined sets relative to an explicitly stated universeCH 1Signed numbersFOUNDATIONSConstruct direct, contrapositive and contradiction arguments with justified stepsCH 1
Connectives and truth tables
Boolean algebra and Karnaugh maps
Logic circuits
Binary and algorithms