Final assessment and submission

This week’s topics

Final assessment and submission

1. Final coursework submission
2. Assessment against all criteria

What you will be able to do

• 1.1 Describe what is meant by binary representation.
• 1.2 Explain how to change between bases.
• 1.3 Explain how numbers are represented in binary.
• 1.4 Evaluate the use of binary representation in the field of computer science.
• 2.1 Describe a range of mathematical proof techniques.
• 2.2 Describe the possible algebraic operations in set theory.
• 2.3 Explain the key principles of (Boolean) propositional logic.
• 2.4 Use truth tables to detail the possible outcomes of binary logical operators.
• 2.5 Analyse the similarities between Boolean logical operators and Boolean algebra in set theory.
• 2.6 Evaluate mathematical proof techniques and the circumstances under which they may be appropriate.
• 3.1 Describe the key principles of modular arithmetic and finite fields.
• 3.2 Explain a range of key number theoretic theorems and proofs.
• 3.3 Analyse the differences between ordinary and modular arithmetic.
• 3.4 Evaluate the use of modular arithmetic and prime numbers in security applications such as cryptography and hashing.
• 4.1 Describe what is meant by a sequence and a series.
• 4.2 Explain the difference between arithmetic and geometric series and sequences.
• 4.3 Use appropriate notation to represent sequences.
• 5.1 Describe what is meant by vectors and matrices.
• 5.2 Use row-reduction to convert a matrix to echelon form.
• 5.3 Solve linear systems of equations using matrices.
• 5.4 Analyse the significance of the determinant of a matrix.
• 5.5 Use a range of techniques to decompose matrices and evaluate their usefulness.

Activity

Final assessment week: submission of the unit assignment.

Study materials