Back to TAS Mathematics Applications
TAS · TASCQ&A
Mathematics ApplicationsQ&A by dot point
A short Q&A bank for every TAS Mathematics Applications syllabus dot point. Each question and answer is drawn directly from our worked dot-point page, so you can scan key concepts before opening the long-form answer.
Unit 3
- Use arithmetic and geometric sequences, including their nth-term and sum rules, to model practical situations.2Q&A pairs
- Identify and find Eulerian trails and circuits and Hamiltonian paths and cycles in networks.0Q&A pairs
- Apply simple and compound interest, depreciation, and recurrence relations to financial situations.3Q&A pairs
- Use first-order linear recurrence relations of the form Vn+1 = R Vn + d to model and analyse practical situations.1Q&A pairs
- Formulate and solve linear programming problems graphically to optimise an objective function.3Q&A pairs
- Perform matrix operations and analyse graphs, paths and networks1Q&A pairs
- Recognise planar graphs and apply Euler's formula relating vertices, edges and faces.2Q&A pairs
- Calculate residuals and use a residual plot to assess the appropriateness of a linear model.2Q&A pairs
- Construct and interpret two-way frequency tables to investigate association between categorical variables.2Q&A pairs
Unit 4
- Model annuities and perpetuities using recurrence relations and analyse the regular payments they support.2Q&A pairs
- Model annuity investments and superannuation where regular contributions are added to a fund that earns compound interest.0Q&A pairs
- Solve allocation problems using the Hungarian algorithm to find an optimal assignment.1Q&A pairs
- Analyse bivariate data using scatterplots, correlation, and least-squares regression lines.4Q&A pairs
- Use activity networks, forward and backward scanning, and float to identify the critical path of a project.0Q&A pairs
- Determine the maximum flow through a network using the maximum-flow minimum-cut theorem.1Q&A pairs
- Model and analyse linear and geometric growth and decay using recurrence relations and rules.1Q&A pairs
- Find minimum spanning trees of weighted networks using a systematic algorithm.1Q&A pairs
- Model reducing-balance loans with recurrence relations and amortisation tables.4Q&A pairs
- Analyse time series using smoothing and trend lines, then forecast future values.5Q&A pairs