MATH40006 Seven Year Effective Coverage Matrix REVISED
English review edition prepared on 4 October 2026 from a preserved source copy. It is a later presentation, not the historical study interface. Source checks and difficulty judgements describe the original material author's own process; they do not indicate Imperial College London endorsement.
Source SHA-256: b53fe19e702db1f74874270c725fa5e0a0ceb6328d1043914a3ba2a7cfcb0975Source date: 2026-08-06
EffectiveCoverage
Source cell order and numeric values are retained; prose labels are translated. Scroll within the table to view all rows and columns.
| ability_id | paper | subquestion | marks | family_name | question_type | new_mock_1 | new_mock_2 | new_mock_3 | new_mock_4 | new_mock_5 | new_mock_6 | new_best_status | new_mock_targets | uncovered_reason |
| AU001 | 2021-22 Assessment 3 | Q1(a) | 4 | LCM Algorithm counts and complexity | Design function tests covering coprime, non-coprime and boundary cases | D | D | D | A | D | D | A | Mock 4 | |
| AU002 | 2021-22 Assessment 3 | Q1(b) | 3 | LCM Algorithm counts and complexity | as repeated addition LCM Add comparison counters to the algorithm | D | D | D | A | D | D | A | Mock 4 | |
| AU003 | 2021-22 Assessment 3 | Q1(c) | 3 | LCM Algorithm counts and complexity | is Euclid LCM Add comparison counters to the algorithm | D | D | D | A | D | D | A | Mock 4 | |
| AU004 | 2021-22 Assessment 3 | Q1(d) | 3 | LCM Algorithm counts and complexity | Use exhaustive experiments to find fixed a worst-case input when | D | D | D | A | D | D | A | Mock 4 | |
| AU005 | 2021-22 Assessment 3 | Q1(e) | 3 | LCM Algorithm counts and complexity | Derive the exact comparison count of the repeated-addition algorithm | D | D | D | A | D | D | A | Mock 4 | |
| AU006 | 2021-22 Assessment 3 | Q1(f) | 2 | LCM Algorithm counts and complexity | Obtain from the worst-case input lcm1 asymptotic complexity of | D | D | D | A | D | D | A | Mock 4 | |
| AU007 | 2021-22 Assessment 3 | Q1(g) | 3 | LCM Algorithm counts and complexity | Find experimentally Euclid Algorithm worst case b | D | D | D | A | D | D | A | Mock 4 | |
| AU008 | 2021-22 Assessment 3 | Q1(h) | 4 | LCM Algorithm counts and complexity | use Fibonacci Proof of the asymptotic formula Euclid Worst-case complexity | D | D | D | A | D | D | A | Mock 4 | |
| AU009 | 2021-22 Assessment 3 | Q2(a) | 4 | Escape time for complex iteration | Construct a two-dimensional grid in the complex plane | D | D | D | D | A | D | A | Mock 5 | |
| AU010 | 2021-22 Assessment 3 | Q2(b) | 4 | Escape time for complex iteration | Mark initial escape points with a Boolean array and display them | D | D | D | D | A | D | A | Mock 5 | |
| AU011 | 2021-22 Assessment 3 | Q2(c) | 4 | Escape time for complex iteration | Perform one complex iteration and record the 1 th escape | D | D | D | D | A | D | A | Mock 5 | |
| AU012 | 2021-22 Assessment 3 | Q2(d) | 7 | Escape time for complex iteration | Wrap the two-dimensional escape-time algorithm in a function | D | D | D | D | A | D | A | Mock 5 | |
| AU013 | 2021-22 Assessment 3 | Q2(e) | 3 | Escape time for complex iteration | Test the escape-time plot with parameters varying over the grid | D | D | D | D | A | D | A | Mock 5 | |
| AU014 | 2021-22 Assessment 3 | Q2(f) | 3 | Escape time for complex iteration | Test fixed c of Julia type plot | D | D | D | D | A | D | A | Mock 5 | |
| AU015 | 2021-22 Assessment 3 | Q3(a) | 2 | Symbolic analysis of dynamical-system stability | Find fixed points of the complex quadratic mapping symbolically | D | D | D | D | A | D | A | Mock 5 | |
| AU016 | 2021-22 Assessment 3 | Q3(b) | 1 | Symbolic analysis of dynamical-system stability | Find the derivative of the mapping | D | D | D | D | A | D | A | Mock 5 | |
| AU017 | 2021-22 Assessment 3 | Q3(c) | 2 | Symbolic analysis of dynamical-system stability | Compute the squared modulus of the derivative at each fixed point | D | D | D | D | A | D | A | Mock 5 | |
| AU018 | 2021-22 Assessment 3 | Q3(d) | 3 | Symbolic analysis of dynamical-system stability | Convert the two stability expressions into NumPy function | D | D | D | D | A | D | A | Mock 5 | |
| AU019 | 2021-22 Assessment 3 | Q3(e) | 4 | Symbolic analysis of dynamical-system stability | Plot stability-boundary contours | D | D | D | D | A | D | A | Mock 5 | |
| AU020 | 2021-22 Assessment 3 | Q3(f) | 3 | Symbolic analysis of dynamical-system stability | Construct and expand the composite mapping f∘f | D | D | D | D | A | D | A | Mock 5 | |
| AU021 | 2021-22 Assessment 3 | Q3(g) | 8 | Symbolic analysis of dynamical-system stability | Repeat the fixed-point analysis for the composite mapping - stability - Complete contour-plot workflow | D | D | D | D | A | D | A | Mock 5 | |
| AU022 | 2021-22 Assessment 3 | Q3(h) | 1 | Symbolic analysis of dynamical-system stability | Explain the relationship between stability curves and the boundary of the non-escaping set | D | D | D | D | A | D | A | Mock 5 | |
| AU023 | 2021-22 Assessment 3 | Q4(a) | 1 | Word-substitution encoding | Check the vocabulary read from the external file | D | D | D | D | D | A | A | Mock 6 | |
| AU024 | 2021-22 Assessment 3 | Q4(b) | 4 | Word-substitution encoding | Copy and shuffle the vocabulary without changing the original | D | D | D | D | D | A | A | Mock 6 | |
| AU025 | 2021-22 Assessment 3 | Q4(c) | 2 | Word-substitution encoding | Pair the two lists into a list of pairs | D | D | D | D | D | A | A | Mock 6 | |
| AU026 | 2021-22 Assessment 3 | Q4(d) | 3 | Word-substitution encoding | Construct from paired data dict and Series | D | D | D | D | D | A | A | Mock 6 | |
| AU027 | 2021-22 Assessment 3 | Q4(e) | 2 | Word-substitution encoding | Encode word by word using a dictionary | D | D | D | D | D | A | A | Mock 6 | |
| AU028 | 2021-22 Assessment 3 | Q4(f) | 2 | Word-substitution encoding | use Series Complete word-by-word encoding | D | D | D | D | D | C | C | Mock 6 | constructed Series but did not separately use Series to encode a complete sentence |
| AU029 | 2021-22 Assessment 3 | Q4(g) | 4 | Word-substitution encoding | Invert the mapping and decode | D | D | D | D | D | A | A | Mock 6 | |
| AU030 | 2021-22 Assessment 3 | Q4(h) | 6 | Word-substitution encoding | Implement and test recursive binary search on a sorted list of pairs | D | D | D | D | D | A | A | Mock 6 | |
| AU031 | 2021-22 Assessment 3 | Q4(i) | 2 | Word-substitution encoding | Encode word by word using the binary-search function | D | D | D | D | D | A | A | Mock 6 | |
| AU032 | 2022-23 Assessment 3 | Q1(a) | 3 | Legendre Recurrence and Gauss integral | Verify the given Legendre Recurrence implementation | D | D | D | A | D | D | A | Mock 4 | |
| AU033 | 2022-23 Assessment 3 | Q1(b) | 5 | Legendre Recurrence and Gauss integral | generate P5, lambdify and plot | D | D | D | A | D | D | A | Mock 4 | |
| AU034 | 2022-23 Assessment 3 | Q1(c) | 5 | Legendre Recurrence and Gauss integral | Plot on the same axes P1-P10 | D | D | D | A | D | D | A | Mock 4 | |
| AU035 | 2022-23 Assessment 3 | Q1(d) | 8 | Legendre Recurrence and Gauss integral | Design an efficient recursive version Legendre function | D | D | D | A | D | D | A | Mock 4 | |
| AU036 | 2022-23 Assessment 3 | Q1(e) | 6 | Legendre Recurrence and Gauss integral | find P5 Roots, derivatives and Gauss weights | D | D | D | A | D | D | A | Mock 4 | |
| AU037 | 2022-23 Assessment 3 | Q1(f) | 8 | Legendre Recurrence and Gauss integral | Using five points Gauss-Legendre Approximate the integral and assess the error | D | D | D | A | D | D | A | Mock 4 | |
| AU038 | 2022-23 Assessment 3 | Q2(a) | 2 | bit shifts and bit_length | Verify experimentally that a left shift is equivalent to multiplication by 2^r | D | D | D | A | D | D | A | Mock 4 | |
| AU039 | 2022-23 Assessment 3 | Q2(b) | 4 | bit shifts and bit_length | Experiment and define right shifts precisely | D | D | D | A | D | D | A | Mock 4 | |
| AU040 | 2022-23 Assessment 3 | Q2(c) | 4 | bit shifts and bit_length | infer bit_length and log2 exact relationship of | D | D | D | A | D | D | A | Mock 4 | |
| AU041 | 2022-23 Assessment 3 | Q3(a) | 4 | Integer square-root algorithms | Implement an integer square root using a linear scan | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU042 | 2022-23 Assessment 3 | Q3(b) | 3 | Integer square-root algorithms | Systematically test the integer square-root invariant | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU043 | 2022-23 Assessment 3 | Q3(c) | 1 | Integer square-root algorithms | Give the iteration complexity of the linear scan | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU044 | 2022-23 Assessment 3 | Q3(d) | 6 | Integer square-root algorithms | use bit_length Improve the initial value using a lower bound and test it | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU045 | 2022-23 Assessment 3 | Q3(e) | 5 | Integer square-root algorithms | Derive exact iteration counts for two input families | D | D | D | D | D | D | D | None | not practised separately bit_length lower-bound linear scan for two families of 2 exact iteration counts near powers |
| AU046 | 2022-23 Assessment 3 | Q3(f) | 1 | Integer square-root algorithms | Give the improved algorithm's best case / Worst-case bound | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU047 | 2022-23 Assessment 3 | Q4(a) | 7 | Integer square-root algorithms | Implement a bit-by-bit integer square root and test large integers | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU048 | 2022-23 Assessment 3 | Q4(b) | 3 | Integer square-root algorithms | Prove the complexity of the bit-by-bit algorithm | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU049 | 2022-23 Assessment 3 | Q4(c) | 5 | Integer square-root algorithms | Hand calculation n=120 and explain how the algorithm constructs binary digits | D | D | D | D | D | D | D | None | did not retain the specified n=120 written step-by-step explanation of the hand calculation |
| AU050 | 2022-23 Assessment 3 | Q5(a) | 7 | Integer square-root algorithms | Implement discrete Newton Integer square root and testing | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU051 | 2022-23 Assessment 3 | Q5(b) | 3 | Integer square-root algorithms | statistics 2^1 to 2^30 of Newton Iteration count | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU052 | 2022-23 Assessment 3 | Q5(c) | 1 | Integer square-root algorithms | Conjecture an initial version from the data Newton is Theta(log n) | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU053 | 2022-23 Assessment 3 | Q5(d) | 5 | Integer square-root algorithms | Improve using an upper bound Newton initial value and test | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU054 | 2022-23 Assessment 3 | Q5(e) | 4 | Integer square-root algorithms | Check using inputs with very large exponents Theta(log log n) | D | D | D | A | D | B | A | Mock 4, Mock 6 | |
| AU055 | 2023-24 Assessment 3 | Q1(a) | 4 | Eratosthenes and the incremental prime algorithm | Test the given Eratosthenes sieve | D | D | A | D | D | D | A | Mock 3 | |
| AU056 | 2023-24 Assessment 3 | Q1(b) | 5 | Eratosthenes and the incremental prime algorithm | Implement conditional in-place appending of primes | D | D | A | D | D | D | A | Mock 3 | |
| AU057 | 2023-24 Assessment 3 | Q1(c) | 4 | Eratosthenes and the incremental prime algorithm | Verify that composites are not appended and primes are appended | D | D | A | D | D | D | A | Mock 3 | |
| AU058 | 2023-24 Assessment 3 | Q1(d) | 4 | Eratosthenes and the incremental prime algorithm | use conditional_append Construct a prime list | D | D | A | D | D | D | A | Mock 3 | |
| AU059 | 2023-24 Assessment 3 | Q1(e) | 4 | Eratosthenes and the incremental prime algorithm | Test the complete prime function | D | D | A | D | D | D | A | Mock 3 | |
| AU060 | 2023-24 Assessment 3 | Q1(f) | 4 | Eratosthenes and the incremental prime algorithm | Compare the running times of a vectorised sieve and trial division up to one million | D | D | A | D | D | D | A | Mock 3 | |
| AU061 | 2023-24 Assessment 3 | Q2(a) | 5 | Integer recursion and digits / Run-length representation | modulo 4 Implement the integer recursive function by cases | D | D | B | D | D | B | B | Mock 3, Mock 6 | |
| AU062 | 2023-24 Assessment 3 | Q2(b) | 3 | Integer recursion and digits / Run-length representation | Check the three specified recursive values | D | D | B | D | D | B | B | Mock 3, Mock 6 | |
| AU063 | 2023-24 Assessment 3 | Q2(c) | 4 | Integer recursion and digits / Run-length representation | plot f(n) point plot of | D | D | B | D | D | B | B | Mock 3, Mock 6 | |
| AU064 | 2023-24 Assessment 3 | Q2(d) | 3 | Integer recursion and digits / Run-length representation | Filter all items that f(2024) equal n | D | D | B | D | D | B | B | Mock 3, Mock 6 | |
| AU065 | 2023-24 Assessment 3 | Q2(e) | 4 | Integer recursion and digits / Run-length representation | Experimental verification f(n)=n two families of closed-form conditions | D | D | D | D | D | D | D | None | did not practise the original function's f(n)=n two families of exact closed-form criteria; only the related digit-identity verification was practised |
| AU066 | 2023-24 Assessment 3 | Q2(f) | 3 | Integer recursion and digits / Run-length representation | Test that the binary conversion functions are mutual inverses | D | D | B | D | D | B | B | Mock 3, Mock 6 | |
| AU067 | 2023-24 Assessment 3 | Q2(g) | 6 | Integer recursion and digits / Run-length representation | Implement compression of consecutive identical elements | D | D | B | D | D | B | B | Mock 3, Mock 6 | |
| AU068 | 2023-24 Assessment 3 | Q2(h) | 4 | Integer recursion and digits / Run-length representation | Verify recursion f Equals the run-length-compressed binary representation | D | D | B | D | D | B | B | Mock 3, Mock 6 | |
| AU069 | 2023-24 Assessment 3 | Q2(i) | 3 | Integer recursion and digits / Run-length representation | using the number of binary digits m Analyse recursive complexity | D | D | B | D | D | B | B | Mock 3, Mock 6 | |
| AU070 | 2023-24 Assessment 3 | Q3(i-a) | 3 | Text data, search and container comparison | Open, read and close the text file lexicon File | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU071 | 2023-24 Assessment 3 | Q3(i-b) | 2 | Text data, search and container comparison | check eval then becomes a list of dictionaries | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU072 | 2023-24 Assessment 3 | Q3(i-c) | 2 | Text data, search and container comparison | Verify conversion from a list of dictionaries to a list of pairs | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU073 | 2023-24 Assessment 3 | Q3(i-d) | 4 | Text data, search and container comparison | Implement sequential search and handle unsuccessful searches | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU074 | 2023-24 Assessment 3 | Q3(i-e) | 2 | Text data, search and container comparison | Test successful and unsuccessful searches | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU075 | 2023-24 Assessment 3 | Q3(i-f) | 3 | Text data, search and container comparison | Analyse the best case for sequential search / Worst-case complexity | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU076 | 2023-24 Assessment 3 | Q3(i-g) | 5 | Text data, search and container comparison | Implement binary search on sorted keys and handle unsuccessful searches | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU077 | 2023-24 Assessment 3 | Q3(i-h) | 2 | Text data, search and container comparison | Test successful and unsuccessful binary searches | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU078 | 2023-24 Assessment 3 | Q3(i-i) | 3 | Text data, search and container comparison | Analyse the best case for binary search / Worst-case complexity | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU079 | 2023-24 Assessment 3 | Q3(ii-a) | 2 | Text data, search and container comparison | Take lexicon convert to Python dictionary | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU080 | 2023-24 Assessment 3 | Q3(ii-b) | 2 | Text data, search and container comparison | Test dictionary hits and KeyError failure | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU081 | 2023-24 Assessment 3 | Q3(ii-c) | 2 | Text data, search and container comparison | Convert the dictionary into pandas Series | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU082 | 2023-24 Assessment 3 | Q3(ii-d) | 2 | Text data, search and container comparison | test Series Successful and unsuccessful searches | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU083 | 2023-24 Assessment 3 | Q3(ii-e) | 6 | Text data, search and container comparison | Compare and explain the running times of four search structures | D | D | A | D | A | B | A | Mock 3, Mock 5, Mock 6 | |
| AU084 | 2025-26 Assessment 2 (latest regular) | Q1(a) | 2 | Visualisation of two-dimensional scalar and vector fields | Construct two high-resolution one-dimensional coordinate arrays | A | D | D | D | D | D | A | Mock 1 | |
| AU085 | 2025-26 Assessment 2 (latest regular) | Q1(b) | 2 | Visualisation of two-dimensional scalar and vector fields | Construct a two-dimensional grid | A | D | D | D | D | D | A | Mock 1 | |
| AU086 | 2025-26 Assessment 2 (latest regular) | Q1(c) | 3 | Visualisation of two-dimensional scalar and vector fields | Display the scalar-field colour map correctly | A | D | D | D | D | D | A | Mock 1 | |
| AU087 | 2025-26 Assessment 2 (latest regular) | Q1(d) | 2 | Visualisation of two-dimensional scalar and vector fields | Plot contours of the scalar field | A | D | D | D | D | D | A | Mock 1 | |
| AU088 | 2025-26 Assessment 2 (latest regular) | Q1(e) | 2 | Visualisation of two-dimensional scalar and vector fields | Construct a low-resolution coordinate array | A | D | D | D | D | D | A | Mock 1 | |
| AU089 | 2025-26 Assessment 2 (latest regular) | Q1(f) | 2 | Visualisation of two-dimensional scalar and vector fields | Construct a low-resolution two-dimensional grid | A | D | D | D | D | D | A | Mock 1 | |
| AU090 | 2025-26 Assessment 2 (latest regular) | Q1(g) | 2 | Visualisation of two-dimensional scalar and vector fields | Plot the rotated-gradient vector field | A | D | D | D | D | D | A | Mock 1 | |
| AU091 | 2025-26 Assessment 2 (latest regular) | Q1(h) | 2 | Visualisation of two-dimensional scalar and vector fields | Red contours overlaid on a blue vector field | A | D | D | D | D | D | A | Mock 1 | |
| AU092 | 2025-26 Assessment 2 (latest regular) | Q1(i) | 3 | Visualisation of two-dimensional scalar and vector fields | Plot a three-dimensional wireframe surface | A | D | D | D | D | D | A | Mock 1 | |
| AU093 | 2025-26 Assessment 2 (latest regular) | Q2(a) | 1 | Pritchard sieve | Describe experimentally tile | A | D | D | D | D | D | A | Mock 1 | |
| AU094 | 2025-26 Assessment 2 (latest regular) | Q2(b) | 1 | Pritchard sieve | Describe experimentally flatnonzero | A | D | D | D | D | D | A | Mock 1 | |
| AU095 | 2025-26 Assessment 2 (latest regular) | Q2(c) | 2 | Pritchard sieve | initialisation Pritchard Sieve state | A | D | D | D | D | D | A | Mock 1 | |
| AU096 | 2025-26 Assessment 2 (latest regular) | Q2(d) | 1 | Pritchard sieve | Create a Boolean array of discard flags | A | D | D | D | D | D | A | Mock 1 | |
| AU097 | 2025-26 Assessment 2 (latest regular) | Q2(e) | 1 | Pritchard sieve | Initialise the algorithm's scalar state | A | D | D | D | D | D | A | Mock 1 | |
| AU098 | 2025-26 Assessment 2 (latest regular) | Q2(f) | 5 | Pritchard sieve | Execute step by step Pritchard sieve | A | D | D | D | D | D | A | Mock 1 | |
| AU099 | 2025-26 Assessment 2 (latest regular) | Q2(g) | 2 | Pritchard sieve | Extract primes from the two state arrays | A | D | D | D | D | D | A | Mock 1 | |
| AU100 | 2025-26 Assessment 2 (latest regular) | Q2(h) | 5 | Pritchard sieve | Wrap a general implementation Pritchard Sieve function | A | D | D | D | D | D | A | Mock 1 | |
| AU101 | 2025-26 Assessment 2 (latest regular) | Q2(i) | 2 | Pritchard sieve | Test typical, boundary and five-digit inputs | A | D | D | D | D | D | A | Mock 1 | |
| AU102 | 2025-26 Assessment 2 (latest regular) | Q3(a) | 2 | Adjacent-entry operations and Stern-Brocot | Implement the adjacent-sum list function | A | D | D | D | D | D | A | Mock 1 | |
| AU103 | 2025-26 Assessment 2 (latest regular) | Q3(b) | 1 | Adjacent-entry operations and Stern-Brocot | Check the adjacent-sum example | A | D | D | D | D | D | A | Mock 1 | |
| AU104 | 2025-26 Assessment 2 (latest regular) | Q3(c) | 2 | Adjacent-entry operations and Stern-Brocot | Interleave the original list with adjacent sums | A | D | D | D | D | D | A | Mock 1 | |
| AU105 | 2025-26 Assessment 2 (latest regular) | Q3(d) | 1 | Adjacent-entry operations and Stern-Brocot | check riffled output | A | D | D | D | D | D | A | Mock 1 | |
| AU106 | 2025-26 Assessment 2 (latest regular) | Q3(e) | 3 | Adjacent-entry operations and Stern-Brocot | Generate iteratively Stern-Brocot number n generation and convert Rational | A | D | D | D | D | D | A | Mock 1 | |
| AU107 | 2025-26 Assessment 2 (latest regular) | Q3(f) | 1 | Adjacent-entry operations and Stern-Brocot | Check the 3 generation rational-number list | A | D | D | D | D | D | A | Mock 1 | |
| AU108 | 2026 Alternative Assessment | Q1(i-a) | 1 | Elementary row operations and row-echelon form | Test the given row_add In-place row replacement | D | A | D | D | D | D | A | Mock 2 | |
| AU109 | 2026 Alternative Assessment | Q1(i-b) | 2 | Elementary row operations and row-echelon form | Implement in-place scaling of a row | D | A | D | D | D | D | A | Mock 2 | |
| AU110 | 2026 Alternative Assessment | Q1(i-c) | 1 | Elementary row operations and row-echelon form | test row_multiply | D | A | D | D | D | D | A | Mock 2 | |
| AU111 | 2026 Alternative Assessment | Q1(i-e) | 3 | Elementary row operations and row-echelon form | Implement safe in-place row swapping | D | A | D | D | D | D | A | Mock 2 | |
| AU112 | 2026 Alternative Assessment | Q1(i-f) | 1 | Elementary row operations and row-echelon form | test row_swap | D | A | D | D | D | D | A | Mock 2 | |
| AU113 | 2026 Alternative Assessment | Q1(ii-a) | 2 | Elementary row operations and row-echelon form | for the 0 column: perform elimination and check | D | A | D | D | D | D | A | Mock 2 | |
| AU114 | 2026 Alternative Assessment | Q1(ii-b) | 2 | Elementary row operations and row-echelon form | Sequence of consecutive pairs 1, 2 Use elimination to obtain upper-triangular form | D | A | D | D | D | D | A | Mock 2 | |
| AU115 | 2026 Alternative Assessment | Q1(ii-c) | 3 | Elementary row operations and row-echelon form | Obtain the determinant from the product of the upper-triangular diagonal entries | D | A | D | D | D | D | A | Mock 2 | |
| AU116 | 2026 Alternative Assessment | Q1(ii-d) | 2 | Elementary row operations and row-echelon form | take 3x4 Reduce the matrix to row-echelon form | D | A | D | D | D | D | A | Mock 2 | |
| AU117 | 2026 Alternative Assessment | Q1(ii-e) | 2 | Elementary row operations and row-echelon form | take 4x3 Reduce the matrix to row-echelon form | D | A | D | D | D | D | A | Mock 2 | |
| AU118 | 2026 Alternative Assessment | Q1(ii-f) | 3 | Elementary row operations and row-echelon form | Derive m×n required zero_column degree | D | A | D | D | D | D | A | Mock 2 | |
| AU119 | 2026 Alternative Assessment | Q1(ii-g) | 5 | Elementary row operations and row-echelon form | Wrap a general implementation that does not change its input row_echelon_form | D | A | D | D | D | D | A | Mock 2 | |
| AU120 | 2026 Alternative Assessment | Q1(ii-h) | 3 | Elementary row operations and row-echelon form | Test matrices of three shapes REF function | D | A | D | D | D | D | A | Mock 2 | |
| AU121 | 2026 Alternative Assessment | Q2(i-a) | 4 | Determinants by elimination and pivot selection | Compute a square matrix's determinant using row-echelon form | D | A | D | D | D | D | A | Mock 2 | |
| AU122 | 2026 Alternative Assessment | Q2(i-b1) | 2 | Determinants by elimination and pivot selection | Numerically test the custom implementation determinant and numpy.det | D | A | D | D | D | D | A | Mock 2 | |
| AU123 | 2026 Alternative Assessment | Q2(i-b2) | 4 | Determinants by elimination and pivot selection | Symbolically compare determinants by elimination and recursive cofactor expansion | D | D | D | D | D | D | D | None | The revised version did not require a proof, for symbolic matrices, that determinants by elimination and cofactor expansion are identical |
| AU124 | 2026 Alternative Assessment | Q2(i-c) | 3 | Determinants by elimination and pivot selection | Derive elimination determinant of Theta(n^3) | D | A | D | D | D | D | A | Mock 2 | |
| AU125 | 2026 Alternative Assessment | Q2(i-d) | 3 | Determinants by elimination and pivot selection | Derive the factorial complexity of recursive cofactor expansion | D | C | D | D | D | D | C | Mock 2 | Only recursive cofactor expansion was executed and timed; a complete proof of its factorial-order recurrence was not required |
| AU126 | 2026 Alternative Assessment | Q2(ii-a) | 1 | Determinants by elimination and pivot selection | Explain argmax Return the position of the maximum | D | A | D | D | D | D | A | Mock 2 | |
| AU127 | 2026 Alternative Assessment | Q2(ii-b) | 4 | Determinants by elimination and pivot selection | is zero_column Add partial pivoting | D | A | D | D | D | D | A | Mock 2 | |
| AU128 | 2026 Alternative Assessment | Q2(ii-c) | 1 | Determinants by elimination and pivot selection | Test elimination with row swapping on a matrix whose first pivot is zero | D | A | D | D | D | D | A | Mock 2 | |
| AU129 | 2026 Alternative Assessment | Q2(ii-d) | 3 | Determinants by elimination and pivot selection | such that zero_column Return whether a row swap occurred | D | A | D | D | D | D | A | Mock 2 | |
| AU130 | 2026 Alternative Assessment | Q2(ii-e) | 1 | Determinants by elimination and pivot selection | test swap flagged as True | D | A | D | D | D | D | A | Mock 2 | |
| AU131 | 2026 Alternative Assessment | Q2(ii-f) | 4 | Determinants by elimination and pivot selection | REF Track the parity sign of row swaps at the same time | D | A | D | D | D | D | A | Mock 2 | |
| AU132 | 2026 Alternative Assessment | Q2(ii-g) | 3 | Determinants by elimination and pivot selection | in determinant correct the row-swap sign in | D | A | D | D | D | D | A | Mock 2 | |
| AU133 | 2026 Alternative Assessment | Q2(ii-h) | 2 | Determinants by elimination and pivot selection | For a matrix with a zero first pivot, compare with numpy.det compare | D | A | D | D | D | D | A | Mock 2 | |
| AU134 | 2026 Alternative Assessment | Q3(a) | 4 | Timing data structures and file export | construct three types of determinant Nested timing dictionary for the implementations | D | A | D | D | D | B | A | Mock 2, Mock 6 | |
| AU135 | 2026 Alternative Assessment | Q3(b) | 2 | Timing data structures and file export | use pickle.dump Export the timing dictionary | D | A | D | D | D | B | A | Mock 2, Mock 6 | |
| AU136 | 2026 Alternative Assessment | Q3(c) | 2 | Timing data structures and file export | Convert the nested dictionary into DataFrame | D | A | D | D | D | B | A | Mock 2, Mock 6 | |
| AU137 | 2026 Alternative Assessment | Q3(d) | 2 | Timing data structures and file export | Take DataFrame export CSV | D | A | D | D | D | B | A | Mock 2, Mock 6 |