SKILL ALIGN · YEAR 12 · 2027
VCE General Mathematics 2027 — Practice Pack 0 Free Sample
Questions, worked solutions and marking guidance
13 additional independent questions introduce all 10 paid-course topic chapters, with worked support and separate solutions. This representative overview shows course breadth, not full-resource depth or complete syllabus mastery.
Version 1.1 · 13 questions · 43 practice marks · Booklet build: 20261112-06
Independent free sample. These 13 questions and their worked examples are additional to the individual and School resources.
Independent Skill Align practice resource. Curriculum reference: VCAA Mathematics Study Design v1.1 (November 2022), General Mathematics Units 3–4, from 2023 (checked 26 October 2026). This resource is not endorsed by VCAA.
How to use this resource
- This independent overview introduces every paid-course topic chapter at representative depth. Read each chapter's prerequisites and worked support, then attempt its questions before opening Solutions.
- Use the material and performance conditions stated in each question. Record topics you have not studied separately; this sample has no course checks or mixed revision.
- Use the worked solutions below to award one mark per criterion. Accept equivalent mathematically correct working. Carry an earlier numerical error forward where the later method is correct; do not award a mark twice for the same step.
- Record your reasoning, independence and next step for each topic on the review sheet. Use a full resource for further practice, course checks and mixed revision.
Untimed VCAA General Mathematics Units 3–4 practice, separate from the two timed examinations. Use approved technology with numerical, graphical, symbolic, financial and statistical functionality; a scientific calculator and bound reference may also support learning. Show the model and evidence rather than calculator output alone. Keep full precision unless a task specifies a rounded table or answer. Payments occur after interest unless stated otherwise. Supplied financial rates and management rules are fictional learning assumptions. Different checks do not measure equated improvement or predict a study score. These representative tasks do not require stored custom CAS functions. For 2027 examinations use VCAA-approved technology in its required restricted mode; user-defined functions and other retrievable information are not permitted. Confirm the authority's final setup instructions when preparing for an examination.
VCAA formula sheet · Approved calculators
Suggested times guide study planning. Questions are grouped for learning; total marks and demand labels do not predict an external examination grade, ATAR or a validated diagnostic score.
Use the working space provided or extra paper labelled with the question reference. Keep your original attempt so you can compare its reasoning with the worked solution below each question.
DIST · Distributions, summaries and normal models
Unit 3; study design pp. 84–85, 89: variable types, categorical/numerical displays, logarithmic scales, quartiles/outliers, sample mean/SD, 68–95–99.7 rule and z-scores.
Before you start: Units 1–2 data types, ordering, percentages and sample statistics.
Suggested study time: 35 minutes, including review.
sample-dist-code-order 3 marks · Technology-active · Apply, investigate and justify
A survey stores journey mode as 1=walk, 2=bus, 3=rail. Counts are 8, 6 and 6. A report calls the mean code 1.9 an average mode. Check the arithmetic, then explain why interchanging codes 1 and 3 changes this mean without changing journeys. Choose an appropriate summary.
Worked solution — sample-dist-code-order
- Mean code=(8+12+18)/20=1.9. Relabelling gives (24+12+6)/20=2.1.
- Mode is nominal: category counts/proportions or modal category walk are meaningful; arithmetic code means are arbitrary.
Marking guidance — one mark per criterion — sample-dist-code-order
- Checks means 1.9 and 2.1.
- Explains arbitrary nominal coding.
- Gives a meaningful categorical summary.
Acceptable alternatives — sample-dist-code-order
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: sample-dist-code-order — Treating numerical labels as measurements.
Next step: sample-dist-code-order — Identify what the values represent before selecting a statistic.
sample-dist-coincident-fences 3 marks · Technology-active · Apply, investigate and justify
Two samples share Q1=10 and Q3=18. Sample A's minimum/maximum are 0 and 29; B's are −3 and 30. Use the 1.5 IQR rule to compare which extremes are possible outliers. Explain why equal IQRs do not imply equal whisker endpoints.
Worked solution — sample-dist-coincident-fences
- IQR=8; fences=−2 and 30. A has no extreme outside the fences. B has a lower outlier −3, while 30 is on the upper fence and is not an upper outlier.
- Whiskers end at observed non-outliers, which quartiles do not specify.
Marking guidance — one mark per criterion — sample-dist-coincident-fences
- Calculates both fences.
- Correctly classifies the four extremes, including equality.
- Explains observed non-outlier whiskers.
Acceptable alternatives — sample-dist-coincident-fences
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: sample-dist-coincident-fences — Calling a value on the fence an outlier.
Next step: sample-dist-coincident-fences — Use strict inequalities and locate actual observations.
sample-dist-reflect-standardisation 3 marks · Technology-active · Apply, investigate and justify
A score X has mean 40 and sample SD 5. A new score is Y=100−2X. Find Y's mean and SD, and compare the z-scores of X=47 and its Y value. State what the minus sign does to relative order.
Worked solution — sample-dist-reflect-standardisation
- Mean Y=20 and SD Y=10; X=47 gives Y=6.
- zX=1.4 and zY=(6−20)/10=−1.4. The negative scale reverses order while preserving absolute standardised distance.
Marking guidance — one mark per criterion — sample-dist-reflect-standardisation
- Finds mean 20 and SD 10.
- Calculates both z-scores.
- Explains order reversal.
Acceptable alternatives — sample-dist-reflect-standardisation
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: sample-dist-reflect-standardisation — Assigning a negative standard deviation.
Next step: sample-dist-reflect-standardisation — Use the absolute scale factor for spread and retain the sign in locations.
sample-dist-log-gap 3 marks · Technology-active · Apply, investigate and justify
A sensor's positive readings are 10, 100 and 1000 units. On a base-10 logarithmic axis these occupy equally spaced positions. Determine the original reading halfway between 100 and 1000 on that axis, and compare it with the arithmetic midpoint. Explain which kind of change equal plotted gaps encode.
Worked solution — sample-dist-log-gap
- The log midpoint is 2.5, so the reading is 10^2.5≈316.228. The arithmetic midpoint is 550.
- Equal log gaps encode equal multiplicative factors; the halfway factor is √10, not half an additive difference.
Marking guidance — one mark per criterion — sample-dist-log-gap
- Finds log midpoint 2.5 and inverse value.
- Calculates arithmetic midpoint 550.
- Explains multiplicative spacing.
Acceptable alternatives — sample-dist-log-gap
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: sample-dist-log-gap — Averaging raw values on a logarithmic scale.
Next step: sample-dist-log-gap — Perform midpoint operations in the plotted variable and back-transform.
ASSOC · Associations and the evidence for a claim
Unit 3; pp. 85, 89–90: two-way tables/segmented bars, paired numerical/categorical displays, scatterplots, Pearson r, explanatory/response variables and observational versus experimental evidence. Representative topic preview; full resources provide broader applications and depth.
Before you start: DIST and explicit conditional denominators.
Suggested study time: 20 minutes, including review.
ASSOC-S1 4 marks · Technology-active · Apply, investigate and justify
A recorded table has group A: 6 yes, 4 no; group B: 4 yes, 6 no. An audit considers correcting k yes records mistakenly labelled A to B, retaining their yes responses and adding no new respondents. Find both original yes rates. Determine k giving equal rates and the smallest whole k giving B a strictly higher yes rate than A. Update each group's denominator as well as its yes count; 0≤k≤6.
Worked solution — ASSOC-S1
- Original yes rates are 6/10=60% and 4/10=40%. After correction they are (6−k)/(10−k) and (4+k)/(10+k).
- At k=2 both are 50%: 4/8 and 6/12. Cross-multiplication gives B>A exactly when k>2, so the smallest whole k is 3, giving A=3/7 and B=7/13.
- This is a stated sensitivity audit of labels, not permission to manufacture responses or evidence that an error actually occurred.
Marking guidance — one mark per criterion — ASSOC-S1
- Finds original rates 60% and 40%
- Updates both numerator and denominator in each corrected group
- Finds the tie k=2
- Establishes minimum strict reversal k=3 with a valid comparison
Acceptable alternatives — ASSOC-S1
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: ASSOC-S1 — Moving yes counts while leaving both group totals at ten.
Next step: ASSOC-S1 — Track each moved respondent in both their old and corrected group.
REG · Regression, residuals and one-axis transformations
Unit 3; pp. 85–86, 89–90: least squares from raw data/summaries, r², residual diagnostics, interpolation/extrapolation, square/base-10 logarithm/reciprocal transformation of one axis. Representative topic preview; full resources provide broader applications and depth.
Before you start: ASSOC, linear equations and transformations with valid domains.
Suggested study time: 20 minutes, including review.
REG-S1 3 marks · Technology-active · Apply, investigate and justify
For observed pairs (0,0), (1,2), (3,2), (4,10), the ordinary least-squares straight line is ŷ=2x−0.5. A dashboard instead displays max(0,2x−0.5), replacing a negative prediction by zero. Find predictions, actual-minus-predicted residuals and SSE for both rules on these observations. The dashboard's SSE is lower: explain why this does not contradict the stated least-squares property of the original straight line.
Worked solution — REG-S1
- The line predicts −0.5, 1.5, 5.5, 7.5; residuals are 0.5, 0.5, −3.5, 2.5 and SSE=0.25+0.25+12.25+6.25=19.
- The clipped rule predicts 0, 1.5, 5.5, 7.5; residuals are 0, 0.5, −3.5, 2.5 and SSE=18.75.
- Clipping changes the model class: max(0,2x−0.5) is piecewise, not a single straight line. Least squares minimises SSE over straight lines; it need not beat every nonlinear or piecewise rule.
Marking guidance — one mark per criterion — REG-S1
- Reconstructs line predictions/residuals and SSE 19
- Reconstructs clipped predictions/residuals and SSE 18.75
- Resolves the apparent contradiction by identifying the changed model class
Acceptable alternatives — REG-S1
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: REG-S1 — Calling the clipped predictions the same straight-line model.
Next step: REG-S1 — State the set of models over which the least-squares claim applies.
TIME · Time series, smoothing and seasonal forecasts
Unit 3; pp. 86, 90: qualitative features, odd moving medians, moving means including centring for even periods, seasonal/yearly means, adjustment, linear trend and reseasonalised forecasts. Representative topic preview; full resources provide broader applications and depth.
Before you start: REG, ordered time indices, means and multiplicative seasonal indices.
Suggested study time: 20 minutes, including review.
TIME-S1 3 marks · Technology-active · Apply, investigate and justify
Two future seasonal forecasts have separately varying de-seasonalised trend bounds T_A in [80,100] and T_B in [90,110]. Their fixed multiplicative seasonal indices are 1.2 and 0.9. Reseasonalise both ranges. A report compares central forecasts 108 and 90 and claims A must exceed B. Test that claim with compatible endpoint forecasts. The stated bounds are deterministic assumptions, not confidence intervals.
Worked solution — TIME-S1
- A's raw forecast range is [96,120]; B's is [81,99].
- Central forecasts are 1.2×90=108 and 0.9×100=90, but admissible endpoints T_A=80 and T_B=110 give A=96 and B=99.
- Thus the assumed ranges allow B>A; comparing central forecasts alone does not establish a guaranteed ordering.
Marking guidance — one mark per criterion — TIME-S1
- Reseasonalises A to [96,120] and B to [81,99]
- Constructs compatible A=96, B=99 endpoint forecasts
- Rejects the guarantee while preserving the deterministic status of the bounds
Acceptable alternatives — TIME-S1
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: TIME-S1 — Comparing only central forecasts when the claim concerns every permitted outcome.
Next step: TIME-S1 — Compare the smallest A with the largest B before asserting an ordering guarantee.
DEP · Recurrences and depreciation decisions
Unit 3; pp. 86–87, 90: first-order linear recurrences; flat-rate, unit-cost and reducing-balance depreciation, future values, model domains and assumptions. Representative topic preview; full resources provide broader applications and depth.
Before you start: Powers, percentage change, initial conditions and integer time.
Suggested study time: 20 minutes, including review.
DEP-S1 3 marks · Technology-active · Apply, investigate and justify
A carriage's position readings along a straight rail are 0,80,20,70 metres in chronological order. It moves monotonically between consecutive readings, with no unrecorded travel. A fictional unit-cost depreciation rule deducts $6 per metre actually travelled from opening book value $5000. Find travelled distance and closing book value. Explain why using final position minus initial position would apply the rule to the wrong usage measure.
Worked solution — DEP-S1
- Travelled distance is |80−0|+|20−80|+|70−20|=80+60+50=190 m. Closing value is 5000−6×190=$3860.
- Net position change is only 70 m; it cancels reversed travel. Wear is explicitly charged on total distance travelled, not displacement.
Marking guidance — one mark per criterion — DEP-S1
- Reconstructs total travel 190 m including both reversals
- Applies unit-cost depreciation to obtain $3860
- Distinguishes accumulated use from net position change using the stated rule
Acceptable alternatives — DEP-S1
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: DEP-S1 — Treating a position coordinate as a cumulative-use meter.
Next step: DEP-S1 — Add the magnitudes of all recorded movements before applying the per-metre charge.
FIN · Interest, loans, annuities and perpetuities
Unit 3; pp. 86–87, 90–91: nominal/effective rates, compound interest, loan/annuity amortisation, TVM, equal periodic additions and sustainable perpetuities. Representative topic preview; full resources provide broader applications and depth.
Before you start: DEP, cash-flow timing and consistent compounding/payment periods.
Suggested study time: 20 minutes, including review.
FIN-S1 4 marks · Technology-active · Apply, investigate and justify
A fictional account opens with $1000 and has no deposits, fees or withdrawals. A draft rule awards 2% interest on opening principal if closing balance AFTER interest is at least $1010; otherwise it awards zero interest. Test a zero-interest closing balance and a bonus-interest closing balance against the rule. Does the draft identify a unique result? Repair it by testing eligibility against OPENING balance instead, and find that repaired result.
Worked solution — FIN-S1
- Zero interest gives a closing balance of $1000, below $1010, consistently qualifying for zero. Bonus interest gives 1000×1.02=$1020, at least $1010, consistently qualifying for the bonus.
- Both results satisfy the draft because eligibility depends on the result it is supposed to determine. It does not select a unique interest outcome.
- Testing opening balance instead makes the condition false: 1000<1010, so the repaired rule gives zero interest and a closing balance of $1000.
Marking guidance — one mark per criterion — FIN-S1
- Checks self-consistent zero-interest closing balance $1000
- Checks self-consistent bonus closing balance $1020
- Identifies the resulting ambiguity rather than selecting a branch without a rule
- Applies opening-balance eligibility to obtain the unique repaired closing balance $1000
Acceptable alternatives — FIN-S1
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: FIN-S1 — Assuming a circular eligibility condition chooses its own unique branch.
Next step: FIN-S1 — Write each candidate closing balance, test its condition, then specify an eligibility time independent of the result.
MAT · Matrix operations and structural applications
Unit 4; pp. 87, 91: matrix types/order, arithmetic/products/powers/transpose/inverse/determinant, binary/permutation matrices, communication and dominance models. Representative topic preview; full resources provide broader applications and depth.
Before you start: Row/column meaning, algebraic equations and ordered products.
Suggested study time: 20 minutes, including review.
MAT-S1 3 marks · Technology-active · Apply, investigate and justify
A directed traffic-count matrix has row origins and column destinations in order A,B,C: M=(0,8,1;2,0,6;5,4,0), with semicolons separating rows. A report replaces it by S=(M+Mᵀ)/2. Calculate S and the correction D=M−S, then verify M=S+D. The report says S retains the original traffic because its grand total is unchanged. Test this using a directional pair, and explain what a negative entry in D means.
Worked solution — MAT-S1
- S=(0,5,3;5,0,5;3,5,0) is symmetric. D=(0,3,−2;−3,0,1;2,−1,0), and adding corresponding entries reconstructs M.
- Both M and S have grand total 26, but A→B changes from 8 to 5 and B→A from 2 to 5. S preserves each opposite-direction pair's combined count, not its original allocation.
- Negative D entries are signed corrections to the averaged table; they are not negative observed traffic. D must be retained to recover the direction-specific counts.
Marking guidance — one mark per criterion — MAT-S1
- Calculates the complete symmetric matrix S
- Calculates D and verifies entrywise reconstruction M=S+D
- Rejects directional equivalence despite total 26 and interprets negative corrections consistently
Acceptable alternatives — MAT-S1
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: MAT-S1 — Treating an aggregate-preserving average as an unchanged directional data table.
Next step: MAT-S1 — Track an individual origin-destination cell before and after averaging, then add its signed correction.
STATE · Transition and Leslie population models
Unit 4; pp. 87–88, 91: column-state recurrences, transition diagrams, regularity/equilibrium, Leslie birth/survival models and culling/restocking with timing. Representative topic preview; full resources provide broader applications and depth.
Before you start: MAT, expected counts and column-origin conventions.
Suggested study time: 20 minutes, including review.
STATE-S1 3 marks · Technology-active · Apply, investigate and justify
A closed two-state population report calls P=(0.2,0.8;0.8,0.2) its transition matrix over TWO equal periods. It also claims one unchanged real two-by-two matrix T applies in each single period, so P=T². Use det(T²)=(det T)² to test that claim. Calculate det P and explain why valid column probabilities alone do not establish this two-period interpretation. Give a possible interpretation that would not require the same T twice.
Worked solution — STATE-S1
- det P=0.2×0.2−0.8×0.8=−0.6. A real determinant squared cannot be negative, so no unchanged real T can satisfy T²=P.
- The entries and column sums can define a valid ONE-period transition matrix, but do not certify its claimed time aggregation. Different successive matrices could also produce P, for example first I and then P.
- The inconsistency concerns the stated homogeneous two-period model; it does not by itself establish that every recorded probability is false.
Marking guidance — one mark per criterion — STATE-S1
- Calculates determinant −0.6
- Uses non-negativity of (det T)² to reject one unchanged T over both periods
- Distinguishes model-time assumptions and gives a valid alternative interpretation
Acceptable alternatives — STATE-S1
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: STATE-S1 — Treating column sums of1 as sufficient to validate every claimed observation interval.
Next step: STATE-S1 — Check the time meaning of the matrix power as well as its probability entries.
ROUTE · Graphs, routes, connectors and shortest paths
Unit 4; pp. 88–89, 91–92: graph conventions/planarity/Euler rule, adjacency, Euler/Hamilton routes, bridges, trees/MST/Prim and Dijkstra labels. Representative topic preview; full resources provide broader applications and depth.
Before you start: MAT, complete edge data, directed/undirected meaning and non-negative distances.
Suggested study time: 20 minutes, including review.
ROUTE-S1 4 marks · Technology-active · Apply, investigate and justify
The supplied undirected network shows real roads D1–A, D2–B, A–B, A–C and B–C in kilometres. V is an artificial vertex with zero-weight links to depots D1 and D2, used only to find the nearest depot to each customer. Run Dijkstra from V to find C's nearest depot, a real road route and distance. Then find the real road distance D1 to D2 after excluding V. Explain why a zero-distance depot-to-depot route through V is not a new physical road.
Worked solution — ROUTE-S1
- From V, D1 and D2 have distance 0; settle B with label 2, A with label 4, then C with label 6. C is nearest to D1 by D1–A–C, length 4+2=6 km; D2's best real route to C costs 2+3+2=7 km.
- Excluding V, D1–A–B–D2 has length 4+3+2=9 km and is shorter than going through C.
- V encodes a choice of starting depot for the nearest-source query. Its zero links are modelling devices, not permission for real travel between depots.
Marking guidance — one mark per criterion — ROUTE-S1
- Obtains Dijkstra labels B=2,A=4,C=6 from the two zero-labelled depots
- Gives nearest depot D1 and real route D1–A–C of 6 km
- Finds real depot-to-depot distance 9 km after excluding V
- Explains the limited query meaning of the artificial zero links
Acceptable alternatives — ROUTE-S1
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: ROUTE-S1 — Interpreting an artificial source-selection link as a free physical road.
Next step: ROUTE-S1 — Remove modelling-only vertices before answering a real road travel query.
DEC · Flow, assignment and project scheduling
Unit 4; pp. 88–89, 92: capacity/conservation and maximum-flow/minimum-cut, bipartite/Hungarian assignments, activity-on-arc/dummy precedence, forward/backward scans, float and crashing. Representative topic preview; full resources provide broader applications and depth.
Before you start: ROUTE, feasible complete decisions and resource/precedence constraints.
Suggested study time: 20 minutes, including review.
DEC-S1 4 marks · Technology-active · Apply, investigate and justify
Two supply branches each carry at most 4 units/minute from a common pump to T. A first model omits the pump's combined limit and reports maximum flow 8. The corrected directed network supplied here includes S→P capacity 6, P→A and P→B capacity 4 each, and A→T and B→T capacity 4 each. Find the old model's optimum, then give a feasible flow and minimum-cut certificate for the corrected optimum. Explain the operational assumption omitted by the first model.
Worked solution — DEC-S1
- The uncoupled first model can send 4 on each branch, total 8. In the corrected network send 6 on S→P, split 4 to A and 2 to B, then send those same amounts to T.
- This respects every capacity and internal conservation. Cut {S} has only outgoing arc S→P with capacity 6, so no greater flow is possible; the corrected maximum is 6 units/minute.
- Both branches share the pump's 6-unit total supply. Treating their individual 4-unit limits as independent complete supplies invents 2 units/minute upstream.
Marking guidance — one mark per criterion — DEC-S1
- Reconstructs old independent-branch optimum 8
- Supplies a capacity-feasible, conserved corrected flow of 6
- Gives an S–T cut of capacity 6 to certify optimality
- Identifies the missing shared pump limit rather than a mistaken branch capacity
Acceptable alternatives — DEC-S1
- Credit equivalent exact or requested rounded results and other valid algebraic, graphical, statistical, matrix or algorithmic methods with supporting evidence. Follow a plausible carried numerical error through a valid later method once; do not restore an earlier lost criterion or double-credit the same reasoning. Accept other justified limitations consistent with the supplied data, domain, timing and constraints.
Common error: DEC-S1 — Adding branch capacities without checking their shared upstream resource.
Next step: DEC-S1 — Represent the shared resource once, then verify both a feasible flow and a matching cut.