Skill Align ACT BSSS Mathematical Applications T Free Online Pack 0 - 2026 Edition
Original Skill Align Mathematical Applications T practice assessment Pack 0; not an official ACT BSSS examination. The 90-mark total and suggested conditions are Skill Align practice conventions.
- Paper
- Question and Response Booklet Showcase
- Reading
- As determined by the administering teacher
- Writing
- 125 minutes
- Assessment
- 90 marks
Suggested conditions for this Skill Align practice assessment: scientific calculators, graphics calculators and CAS are permitted; offline spreadsheet and financial software are permitted; internet access and communication functions are prohibited. No formula or reference sheet is included in this booklet, although the administering teacher may supply one. A ruler and protractor are required; a compass is permitted. No public PDF download is supplied with Pack 0.
Question and Response Booklet
Answer all questions. Select and justify methods, show complete working, use appropriate technology, state units and communicate conclusions in context. This paper is worth 90 marks as a Skill Align practice convention and has a suggested working time of 125 minutes. Suggested conditions for this Skill Align practice assessment: scientific calculators, graphics calculators and CAS are permitted; offline spreadsheet and financial software are permitted; internet access and communication functions are prohibited. No formula or reference sheet is included in this booklet, although the administering teacher may supply one. A ruler and protractor are required; a compass is permitted.
Question 1
10 marksQuestion 2
10 marksQuestion 3
10 marksQuestion 4
10 marksQuestion 5
10 marksQuestion 6
10 marksQuestion 7
10 marksQuestion 8
10 marksQuestion 9
10 marksWorked Solutions And Marking Guide
Question 1
(a) 33.
12+3.5(6)=33.
(b) 2.
Observed minus predicted is 35-33.
(c) r=+0.90. Approximately 81% of the observed variation in assessment score is accounted for by the fitted linear relationship. The value x=20 is outside the observed range 2leq xleq10, so the prediction is extrapolation.
Because the fitted gradient is positive, take the positive square root: r=+√0.81=+0.90. The coefficient of determination means that approximately 81% of the observed variation in assessment score is accounted for by the fitted linear relationship. The observed training hours run from 2 to 10, so using x=20 is extrapolation and the fitted relationship may not continue.
Detailed marking criteria
Part a (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: substitutes x=6 into hat y=12+3.5x; calculates 12+3.5(6)=33; states the predicted assessment score is 33. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: Direct calculator evaluation of the fitted-line expression is acceptable when the substitution is shown.
Do not credit by itself: using the observed score 35 instead of the fitted value; omitting the substitution x=6
Part b (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: uses residual = observed - predicted; substitutes 35-33; states the residual is +2 score points. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: Equivalent signed-deviation notation is acceptable if observed minus predicted is clear.
Do not credit by itself: reversing the subtraction to give -2; reporting 35 or 33 without a residual calculation
Part c (4 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 4: uses the positive fitted gradient to select r=+√0.81=+0.90; interprets r²=0.81 as approximately 81% of observed score variation accounted for by the fitted linear relationship; compares x=20 with the observed range 2leq xleq10; identifies extrapolation and explains that the fitted relationship may not continue outside the observed range.
Acceptable alternatives: The equivalent decimal r=0.9 and equivalent wording for variation accounted for by the model are acceptable.
Do not credit by itself: taking r=-0.90 despite the positive gradient; describing 81% of scores rather than variation; calling x=20 interpolation
Question 2
(a) M_(n+1)=1.06M_n+25, M_0=420.
Apply percentage growth before adding new members.
(b) 470.2, modelled as about 470 members.
1.06(420)+25=470.2.
(c) M_2=523.412, about 523 members; people are discrete and the growth rate may change.
Iterate once more and interpret the model limitations.
Detailed marking criteria
Part a (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: uses the growth multiplier 1.06 on M_n; adds 25 after applying growth; states M_(n+1)=1.06M_n+25 with M_0=420.
Acceptable alternatives: The equivalent shifted form M_n=1.06M_(n-1)+25, M_0=420, is acceptable.
Do not credit by itself: using 1.6 or 0.06 as the growth multiplier; adding 25 before applying the 6% growth; omitting M_0=420
Part b (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: substitutes M_0=420 into M_1=1.06M_0+25; calculates M_1=470.2; interprets the model output as about 470 members. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: Either the model value 470.2 or the contextual estimate of about 470 members is acceptable when its meaning is stated.
Do not credit by itself: calculating only the 6% increase; rounding before adding 25; presenting 470.2 as an exact count of people
Part c (4 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 4: retains M_1=470.2 for the next iteration; calculates M_2=1.06(470.2)+25=523.412; interprets the result as about 523 members; states that membership is discrete and the assumed 6% rate may change. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: A correctly rounded whole-member estimate is acceptable after the unrounded model value has been established.
Do not credit by itself: using a rounded M_1 without showing the model value; treating 523.412 as an exact headcount; giving a generic limitation unrelated to discreteness or the fixed growth rate
Question 3
(a) A-B-C-D-E, with a total length of 14 km.
The route A-B-C-D-E has length 4+2+3+5=14 km, which is less than every other viable route total.
(b) Edges BC, CD, AB and DE; total 14 km.
Choose the least edges without creating a cycle while connecting every site.
(c) The shortest route minimises one A-to-E journey; the spanning tree connects all sites at minimum total installation length.
They solve different network optimisation problems.
Detailed marking criteria
Part a (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: forms the viable route A-B-C-D-E; calculates its length as 4+2+3+5=14 km; verifies no alternative A-to-E route has a lower total. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: Dijkstra's algorithm or an exhaustive, correctly totalled route comparison is acceptable.
Do not credit by itself: listing A-B-C-D-E without its total; selecting a route using the fewest edges rather than the least total weight
Part b (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: selects BC, CD, AB and DE without forming a cycle; connects all five sites using exactly four edges; calculates the selected-edge total 2+3+4+5=14 km. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: Kruskal's or Prim's algorithm is acceptable if it produces the stated tree and total.
Do not credit by itself: including a cycle; leaving a site disconnected; reporting the shortest A-to-E route without constructing a spanning tree
Part c (4 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 4: recognises that both verified totals are 14 km; states that the shortest-path problem minimises one route from A to E; states that the minimum spanning tree connects all sites using the minimum total selected edge length; explains that the equal totals are coincidental and do not make the two optimisation problems equivalent.
Acceptable alternatives: Equivalent network-optimisation wording is acceptable when the one-route and all-sites objectives are both explicit.
Do not credit by itself: saying only that both answers are 14 km; claiming that a shortest path must also be a minimum spanning tree
Question 4
(a) Year 1: 420; Year 2: 446.
Add the four quarterly values for each year.
(b) Approximately 6.2%.
(446-420) / 420 × 100approx6.2%.
(c) Quarter 3 is highest in both years; two years are too few to assume the pattern will continue unchanged.
Identify repeated within-year structure and the limited data span.
Detailed marking criteria
Part a (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: adds 80+110+140+90 to obtain the Year 1 total 420; adds 84+116+150+96 to obtain the Year 2 total 446; labels both annual totals with the correct year. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: A correct table or spreadsheet sum is acceptable when the four values assigned to each year are visible.
Do not credit by itself: combining all eight quarters into one total; swapping the Year 1 and Year 2 totals
Part b (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: uses the increase 446-420=26; divides by the original total 420 and multiplies by 100; rounds 6.190ldots% to 6.2%. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: An equivalent percentage-change calculation is acceptable if Year 1 is used as the base.
Do not credit by itself: dividing by 446; reporting the raw increase 26 as a percentage; failing to round to one decimal place
Part c (4 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 4: identifies Quarter 3 as the highest quarter in Year 1; identifies Quarter 3 as the highest quarter in Year 2; describes the repeated Quarter 3 peak as the observed seasonal feature; states that only two years of data are insufficient to assume the pattern will continue unchanged.
Acceptable alternatives: Equivalent wording about a repeated within-year Quarter 3 peak and the short data span is acceptable.
Do not credit by itself: describing only an overall increase between years; asserting that Quarter 3 will always be highest without acknowledging the two-year limitation
Question 5
(a) P_(n+1)=1.004P_n-550, P_0=18000.
Apply interest and then the repayment.
(b) AUD 17,522.
1.004(18000)-550=17522.
(c) AUD 17,042.09; interest is added before each repayment.
1.004(17522)-550=17042.088.
Detailed marking criteria
Part a (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: uses the monthly interest multiplier 1.004 on P_n; subtracts 550 after applying interest; states P_(n+1)=1.004P_n-550 with P_0=18(,)000.
Acceptable alternatives: The equivalent shifted form P_n=1.004P_(n-1)-550, P_0=18(,)000, is acceptable.
Do not credit by itself: using 1.04 as the multiplier; subtracting the repayment before interest; omitting the initial balance
Part b (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: substitutes P_0=18(,)000 into the recurrence; calculates 1.004(18(,)000)-550=17(,)522; states the balance as AUD 17(,)522. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: A separated interest-plus-repayment calculation is acceptable if it is equivalent to the recurrence.
Do not credit by itself: subtracting AUD 550 without adding interest; using 4% instead of 0.4%; omitting the AUD context
Part c (4 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 4: uses the unrounded first balance 17(,)522; calculates 1.004(17(,)522)-550=17(,)042.088; rounds the balance to AUD 17(,)042.09; explains that monthly interest offsets part of each repayment, so the two-repayment fall is not exactly AUD 1(,)100. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: An equivalent month-by-month schedule is acceptable if interest is applied before each repayment and rounding occurs only at the end.
Do not credit by itself: subtracting AUD 1100 directly from the opening balance; rounding before the second interest calculation; attributing the difference to fees not stated in the model
Question 6
(a) S-A-C-T takes 12 days; S-B-D-T takes 13 days.
Add the durations along each chain.
(b) S-B-D-T, with a project duration of 13 days.
The required duration is the longer complete chain: 6+4+3=13 days on S-B-D-T.
(c) The new project duration is 14 days on S-A-C-T.
The delayed upper chain becomes 4+7+3=14 days, so S-A-C-T becomes critical.
Detailed marking criteria
Part a (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: calculates 4+5+3=12 days for S-A-C-T; calculates 6+4+3=13 days for S-B-D-T; labels each duration with its corresponding complete chain. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: A forward-pass table is acceptable if it establishes the same two complete-chain durations.
Do not credit by itself: adding edges from different chains; reporting only the longer duration without the duration of each chain
Part b (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: uses the complete-chain durations 12 and 13 days; selects the longer chain S-B-D-T; states the project duration is 13 days.
Acceptable alternatives: Equivalent critical-path or forward-pass working is acceptable if it identifies S-B-D-T and 13 days.
Do not credit by itself: selecting the shorter 12-day chain; identifying a single activity rather than a complete critical path
Part c (4 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 4: increases the A-C duration from 5 to 7 days; calculates the delayed upper chain as 4+7+3=14 days; compares 14 days with the unchanged lower-chain duration 13 days; states the new critical path S-A-C-T and project duration 14 days. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: A revised forward pass is acceptable if it shows the upper path at 14 days and the lower path at 13 days.
Do not credit by itself: adding two days to the whole project without checking both paths; retaining S-B-D-T as critical after the upper path becomes longer
Question 7
(a) P=2, Q=3, R=3, S=2.
Count the edges incident to each vertex.
(b) No; Q and R have odd degree.
An Euler circuit requires every vertex to have even degree.
(c) Yes; for example Q-P-R-S-Q-R.
Exactly two vertices have odd degree, so a trail begins at one and ends at the other.
Detailed marking criteria
Part a (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: counts two incident edges at P and states deg(P)=2; counts three incident edges at each of Q and R and states deg(Q)=deg(R)=3; counts two incident edges at S and states deg(S)=2.
Acceptable alternatives: An adjacency list or row-sum method is acceptable if each undirected edge is counted once at each endpoint.
Do not credit by itself: counting an undirected edge only at one endpoint; confusing degree with the total number of vertices
Part b (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: states that an Euler circuit requires every non-isolated vertex to have even degree; identifies Q and R as the two odd-degree vertices; concludes that no Euler circuit exists.
Acceptable alternatives: Equivalent use of Euler's circuit theorem is acceptable.
Do not credit by itself: claiming connectivity alone guarantees an Euler circuit; giving no conclusion after identifying the odd vertices
Part c (4 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 4: states that a connected graph with exactly two odd-degree vertices has an Euler trail; identifies Q and R as the required start and end vertices; gives a valid trail such as Q-P-R-S-Q-R; verifies that every edge is used exactly once.
Acceptable alternatives: The reverse trail R-Q-S-R-P-Q, or any other valid edge-once trail from one odd vertex to the other, is acceptable.
Do not credit by itself: giving a route that repeats or omits an edge; starting and ending at even-degree vertices; calling the open trail a circuit
Question 8
(a) 135.
(120+135+150) / 3=135.
(b) 139, 136 and 134.
Move the three-month window one month at a time.
(c) The underlying level is fairly stable around the mid-130s, while short peaks and falls are reduced.
Moving averages emphasise trend but suppress local variation.
Detailed marking criteria
Part a (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: selects the first three observations 120,135,150; calculates 120+135+150=405; divides by 3 to obtain the centred moving average 135. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: A technology mean calculation is acceptable if the selected three observations are identified.
Do not credit by itself: dividing by the six observations; using only two observations; reporting the total 405 rather than the mean
Part b (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: uses 135,150,132 to calculate 139; uses 150,132,126 to calculate 136; uses 132,126,144 to calculate 134. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: Equivalent spreadsheet or calculator means are acceptable when the three windows and the order 139, 136, 134 are clear.
Do not credit by itself: using non-overlapping windows; failing to drop the oldest observation when the window moves; listing the averages in the wrong order
Part c (4 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 4: compares the moving averages 135,139,136,134 with the original observations; identifies an underlying level around the mid-130s; states that the smoothed series is fairly stable rather than showing a strong sustained trend; explains that smoothing suppresses short local peaks and falls such as 150 and 120. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: Equivalent wording about a stable underlying level and reduced local variation is acceptable.
Do not credit by itself: claiming that smoothing preserves every peak; describing only one original value without interpreting the smoothed pattern
Question 9
(a) The shortest time is 6 minutes via A-C-D.
The route A-C-D takes 4+2=6 minutes, less than the alternatives through B.
(b) The shortest time is 5 minutes via D-E-F.
The route D-E-F takes 3+2=5 minutes, compared with 7 minutes on the direct edge.
(c) The minimum inspected route is A-C-D-E-F, taking 11 minutes.
Combine the shortest required sections: 6+5=11 minutes on A-C-D-E-F.
Detailed marking criteria
Part a (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: forms the route A-C-D; calculates its time as 4+2=6 minutes; verifies it is shorter than alternatives from A to D. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: Dijkstra's algorithm or an exhaustive route comparison is acceptable.
Do not credit by itself: using the fewest edges without comparing weights; giving 6 minutes without the A-C-D route
Part b (3 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 3: forms the route D-E-F; calculates its time as 3+2=5 minutes; compares 5 minutes with the direct D-F edge of 7 minutes. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: Dijkstra's algorithm or a correct direct comparison is acceptable.
Do not credit by itself: choosing the direct 7-minute edge without comparing the route via E; giving 5 minutes without the D-E-F route
Part c (4 marks)
Award one mark for each distinct evidence statement demonstrated, to a maximum of 4: uses the verified shortest section A-C-D=6 minutes; uses the verified shortest section D-E-F=5 minutes; combines the sections as A-C-D-E-F and confirms that the route passes through D; calculates the constrained minimum total 6+5=11 minutes. Apply consequential marking when a correct later method uses an earlier incorrect value, unless that value makes the task materially easier.
Acceptable alternatives: Equivalent section-by-section shortest-path working is acceptable if the complete route A-C-D-E-F and 11 minutes are stated.
Do not credit by itself: giving an unconstrained A-to-F route that bypasses D; adding incompatible partial routes; omitting the complete route or total time
Diagnostic Checklist
| Topic | Questions | Marks | Marks Lost | Action |
|---|---|---|---|---|
| Unit 3 — Bivariate data analysis — substitute into a fitted regression line | Q1(a) | 3 | ___ | Q1(a): Substitute x=6 into hat y=12+3.5x, evaluate the expression, and state the predicted assessment score. |
| Unit 3 — Bivariate data analysis — calculate a signed residual | Q1(b) | 3 | ___ | Q1(b): Calculate residual as observed minus predicted: 35-33=2, and retain the positive sign. |
| Unit 3 — Bivariate data analysis — interpret correlation, determination and extrapolation | Q1(c) | 4 | ___ | Q1(c): Take the positive square root of 0.81, interpret r² as explained observed variation, and compare x=20 with 2leq xleq10. |
| Unit 3 — Growth and decay in sequences — form a growth-then-addition recurrence | Q2(a) | 3 | ___ | Q2(a): Apply 6% growth to M_n, then add 25 members, and include the initial value M_0=420. |
| Unit 3 — Growth and decay in sequences — iterate a membership recurrence once | Q2(b) | 3 | ___ | Q2(b): Substitute M_0=420 into the recurrence, calculate 1.06(420)+25, and interpret the decimal as a whole-member estimate. |
| Unit 3 — Growth and decay in sequences — iterate and evaluate a discrete growth model | Q2(c) | 4 | ___ | Q2(c): Use unrounded M_1=470.2 in the recurrence, calculate M_2, then state both the whole-person interpretation and a limitation of constant-percentage growth. |
| Unit 3 — Graphs and networks — find a shortest weighted path | Q3(a) | 3 | ___ | Q3(a): Use Dijkstra's algorithm or compare complete route totals, then state A-B-C-D-E and 14 km. |
| Unit 3 — Graphs and networks — construct a minimum spanning tree | Q3(b) | 3 | ___ | Q3(b): Select the lowest-weight edges without forming a cycle until all five sites are connected, then add the four selected weights. |
| Unit 3 — Graphs and networks — distinguish shortest-path and spanning-tree objectives | Q3(c) | 4 | ___ | Q3(c): Compare the two verified 14 km results by stating each optimisation objective and why equal totals do not make the problems equivalent. |
| Unit 4 — Time series analysis — calculate annual totals from quarterly data | Q4(a) | 3 | ___ | Q4(a): Add the four stated quarterly values separately for each year and label the totals Year 1 and Year 2. |
| Unit 4 — Time series analysis — calculate percentage change from annual totals | Q4(b) | 3 | ___ | Q4(b): Calculate (446-420) / 420 × 100 and round the percentage increase to one decimal place. |
| Unit 4 — Time series analysis — identify seasonality and a forecasting limitation | Q4(c) | 4 | ___ | Q4(c): Compare the four quarters in both years, identify the repeated Quarter 3 peak, and explain why a two-year pattern is weak forecasting evidence. |
| Unit 4 — Loans, investments and annuities — form an interest-then-repayment recurrence | Q5(a) | 3 | ___ | Q5(a): Apply the 0.4% interest multiplier before subtracting the AUD 550 repayment, and include P_0=18(,)000. |
| Unit 4 — Loans, investments and annuities — calculate a loan balance after one repayment | Q5(b) | 3 | ___ | Q5(b): Calculate interest on AUD 18(,)000, subtract the first AUD 550 repayment, and state the resulting balance in dollars. |
| Unit 4 — Loans, investments and annuities — retain precision in a second loan iteration | Q5(c) | 4 | ___ | Q5(c): Retain calculator precision when applying interest to 17(,)522, subtract the second repayment, round to cents, and explain the interest effect. |
| Unit 4 — Networks and decision mathematics — calculate complete project-path durations | Q6(a) | 3 | ___ | Q6(a): Add the edge durations along each complete S-to-T chain and keep the two chain labels attached to their totals. |
| Unit 4 — Networks and decision mathematics — identify a critical path from path durations | Q6(b) | 3 | ___ | Q6(b): Compare the two complete path durations; select the longest required chain as critical and state its duration. |
| Unit 4 — Networks and decision mathematics — recalculate a delayed critical path | Q6(c) | 4 | ___ | Q6(c): Add the two-day delay to activity A-C, recalculate the upper path, compare both paths, and identify the new critical path and duration. |
| Unit 3 — Graphs and networks — count vertex degrees in an undirected graph | Q7(a) | 3 | ___ | Q7(a): Count the edges incident to each vertex and record the four degrees in P, Q, R, S order. |
| Unit 3 — Graphs and networks — apply the Euler-circuit degree condition | Q7(b) | 3 | ___ | Q7(b): Apply the all-even degree condition, identify the odd vertices Q and R, and state the circuit conclusion. |
| Unit 3 — Graphs and networks — justify and construct an Euler trail | Q7(c) | 4 | ___ | Q7(c): Use the exactly-two-odd-vertices rule, start at Q or R, and trace every edge once to the other odd vertex. |
| Unit 4 — Time series analysis — calculate a three-point moving average | Q8(a) | 3 | ___ | Q8(a): Add the first three observations and divide by three to obtain the first centred moving average. |
| Unit 4 — Time series analysis — slide a three-point moving-average window | Q8(b) | 3 | ___ | Q8(b): Move the three-observation window forward one month at a time and divide each new window total by three. |
| Unit 4 — Time series analysis — interpret the effect of time-series smoothing | Q8(c) | 4 | ___ | Q8(c): Compare the original and smoothed series, describe the mid-130s level, and name the short-term variation that smoothing reduces. |
| Unit 4 — Networks and decision mathematics — find the shortest path to a required inspection site | Q9(a) | 3 | ___ | Q9(a): Use Dijkstra's algorithm or compare A-to-D route totals, then state A-C-D and 6 minutes. |
| Unit 4 — Networks and decision mathematics — find the shortest onward path from the inspection site | Q9(b) | 3 | ___ | Q9(b): Compare the D-E-F and direct D-F totals, then state D-E-F and 5 minutes. |
| Unit 4 — Networks and decision mathematics — combine shortest sections under a route constraint | Q9(c) | 4 | ___ | Q9(c): Combine the verified shortest A-to-D and D-to-F sections, confirm the complete route passes through D, and add their times. |