Understand first-order recurrences as financial growth and decay models.
Understand first-order recurrences as financial growth and decay models.
Area of Study 2
Open a heading to see its content focus, source page and related topic practice. These descriptions are paraphrases of the published requirements.
Generate a sequence with an initial value and a first-order linear recurrence.
This topic includes; bullet 1; p. 86Model and compare flat-rate, unit-cost and reducing-balance depreciation numerically and graphically.
This topic includes; bullet 2; p. 86Use explicit future-value formulas for the named depreciation methods.
This topic includes; bullet 3; p. 86Distinguish simple and compound interest.
This topic includes; bullet 1; p. 86Iterate, tabulate and graph a compound-interest loan or investment.
This topic includes; bullet 2; p. 86Compare nominal rates by converting for their compounding frequencies to effective rates.
This topic includes; bullet 3; p. 86Use a compound-interest future-value formula in practical problems.
This topic includes; bullet 4; p. 86Iterate and analyse a repayment recurrence numerically and graphically.
This topic includes; bullet 1; p. 86Build an amortisation table showing payment, interest, principal repaid and closing balance.
This topic includes; bullet 2; p. 86Use financial technology to analyse repayments, duration, interest changes and total costs.
This topic includes; bullet 3; p. 87Model an annuity with a recurrence and analyse its early balances numerically and graphically.
This topic includes; bullet 1; p. 87Use a stepwise table to track annuity payment, interest, principal reduction and balance.
This topic includes; bullet 2; p. 87Use technology to calculate annuity income or required starting capital.
This topic includes; bullet 3; p. 87Explain a perpetuity as a special indefinitely sustainable annuity.
This topic includes; bullet 4; p. 87Iterate a recurrence for regularly added equal savings and analyse its behaviour.
This topic includes; bullet 1; p. 87Track deposits, earned interest and balances in a stepwise investment table.
This topic includes; bullet 2; p. 87Use financial technology to solve for savings value, duration, rate or deposit needed to meet a target.
This topic includes; bullet 3; p. 87Use matrix dimensions, the named matrix types, transpose and elementary operations.
This topic includes; bullet 1; p. 87Use determinants and inverses, recognising when no inverse exists.
This topic includes; bullet 2; p. 87Construct a matrix from tabular data or a rule for its entries.
This topic includes; bullet 3; p. 87Apply binary and permutation matrices and explain their properties.
This topic includes; bullet 4; p. 87Analyse communication links and tournament dominance using matrices.
This topic includes; bullet 5; p. 87Iterate transition or Leslie matrix recurrences using an initial column state.
This topic includes; bullet 1; p. 88Identify a regular process’s equilibrium informally from successive states.
This topic includes; bullet 2; p. 88Build transition diagrams and matrices for discrete population models and analyse their implications.
This topic includes; bullet 3; p. 88Extend a matrix recurrence with a culling or restocking vector.
This topic includes; bullet 4; p. 88Use graph and directed-network terminology, including planar Euler relationships.
This topic includes; bullet 1; p. 88Represent and apply graphs, directed graphs and networks with matrices.
This topic includes; bullet 2; p. 88Distinguish walks, trails, paths, circuits and cycles.
This topic includes; bullet 1; p. 88Apply the conditions and properties of Eulerian trails and circuits.
This topic includes; bullet 2; p. 88Apply Hamiltonian path and cycle concepts to practical questions.
This topic includes; bullet 3; p. 88Recognise trees and spanning trees.
This topic includes; bullet 1; p. 88Find a minimum spanning tree by inspection or Prim’s algorithm.
This topic includes; bullet 2; p. 88Use minimum spanning trees to solve minimum-connection applications.
This topic includes; bullet 3; p. 88Model a flow problem with capacities, a source and a sink.
This topic includes; bullet 1; p. 88Solve small flows by inspection and larger flows using maximum-flow/minimum-cut reasoning.
This topic includes; bullet 2; p. 88Find a path of least total weight between two vertices by inspection.
This topic includes; bullet 1; p. 89Use Dijkstra’s algorithm to find shortest distances from one starting vertex to all others.
This topic includes; bullet 2; p. 89Represent an assignment problem with a bipartite graph and a table or matrix.
This topic includes; bullet 1; p. 89Find optimal assignments by inspection or the Hungarian algorithm.
This topic includes; bullet 2; p. 89Build an activity network from precedence data, adding dummy activities where required.
This topic includes; bullet 1; p. 89Use forward and backward passes to calculate earliest and latest starts.
This topic includes; bullet 2; p. 89Identify critical paths and calculate non-critical floats.
This topic includes; bullet 3; p. 89Analyse crashing choices that reduce total project duration.
This topic includes; bullet 4; p. 89Outcome 1 retains the study design’s area and topic groups. Outcomes 2 and 3 include skills used across the course. Individual learning targets are concise paraphrases; the source reference identifies the original list. Internal Aspire references are not VCAA codes.
Understand first-order recurrences as financial growth and decay models.
Understand flat-rate, unit-cost and reducing-balance depreciation and future-value formulas.
Explain interest rates, present and future value, loan or annuity amortisation and its tables.
Recognise recurrence models for interest, depreciation, loans, annuities, perpetuities and regular savings.
Form and analyse a first-order linear recurrence in a financial setting.
Iterate a recurrence to find initial asset, investment or loan values over time.
Use a future-value rule for an investment, loan or depreciating asset.
Construct, analyse and interpret a loan or annuity amortisation table.
Use financial technology to solve investment, loan, annuity, perpetuity and regular-saving problems.
Understand matrix dimensions, named types, transpose, arithmetic and powers.
Explain the determinant criterion for a matrix inverse.
Understand the fixed-population and current-state assumptions of a transition model.
Interpret communication and dominance matrices.
Connect transition diagrams, matrices and regularity.
Iterate a matrix recurrence and recognise an eventual steady state in a regular process.
Convert between a transition matrix, transition diagram and verbal description.
Construct a transition matrix for a population with an equilibrium state.
Model population change including culling or restocking with a matrix recurrence.
Understand graph types, adjacency matrices and planar Euler relationships.
Understand travelling and exploring problems and Eulerian or Hamiltonian traversal.
Understand minimum connectors, spanning trees and Prim’s procedure.
Understand capacities, cuts and the maximum-flow minimum-cut relationship.
Understand shortest paths and Dijkstra’s procedure.
Understand assignment and the Hungarian procedure.
Understand scheduling networks and critical-path analysis.
Construct a practical graph, directed graph or network and its matrix representation.
Solve travelling or exploring problems using the appropriate traversal concepts.
Solve minimum-connector problems by inspection or Prim’s algorithm.
Model and solve flow problems using inspection or maximum-flow/minimum-cut reasoning.
Solve shortest-path problems by inspection or Dijkstra’s algorithm.
Solve assignment problems by inspection or the Hungarian algorithm.
Solve scheduling problems using critical-path analysis.
Outcomes 2 and 3 develop investigation, modelling and technology skills across the relevant areas.