← General Mathematics syllabus

VICGeneral Mathematics

Unit 4 Matrices

11 dot points across 11 inquiry questions. Click any dot point for a focused answer with worked past exam questions where available.

How do communication and dominance matrices use a matrix of zeros and ones to count direct and indirect links, and how do you rank competitors?

Build a binary communication or dominance matrix, square it to count two-step links, add the matrix and its square to combine one-step and two-step connections, and rank competitors by their total
A focused answer to the VCE General Mathematics Unit 4 Matrices key-knowledge point on communication and dominance matrices. Building a binary matrix of direct links, squaring it for two-step connections, summing the matrix and its square, and ranking by row totals.
6 min answer →

How is a project scheduled with critical path analysis, and how are maximum flow and bipartite allocation problems solved?

Construct an activity network, use forward and backward scanning to find earliest and latest start times, floats and the critical path, determine the maximum flow through a network using the minimum cut, and solve an allocation problem with the Hungarian algorithm
A focused answer to the VCE General Mathematics Unit 4 Networks key-knowledge point on decision mathematics. Activity networks, forward and backward scanning, float and the critical path, the maximum-flow minimum-cut idea, and the Hungarian algorithm for allocation.
6 min answer →

What is the difference between Eulerian and Hamiltonian travel, and how do vertex degrees decide whether an Eulerian trail or circuit exists?

Distinguish walks, trails, paths, cycles, Eulerian trails and circuits, and Hamiltonian paths and cycles, and use the number of odd-degree vertices to decide whether an Eulerian trail or circuit exists in a connected graph
A focused answer to the VCE General Mathematics Unit 4 Networks key-knowledge point on traversing graphs. Walks, trails, paths and cycles, the odd-degree-vertex test for Eulerian trails and circuits, and the contrast with Hamiltonian paths and cycles that visit vertices.
6 min answer →

What are the key terms of graph theory, and how are spanning trees and shortest paths found in a weighted network?

Use graph and network terminology (vertices, edges, degree, connected, planar), apply Euler's formula and the handshake result, find a minimum spanning tree, and determine the shortest path through a weighted network
A focused answer to the VCE General Mathematics Unit 4 Networks key-knowledge point on graph fundamentals. Vertices, edges and degree, the handshake result, Euler's formula for planar graphs, minimum spanning trees, and finding the shortest path in a weighted network.
6 min answer →

How does a Leslie matrix model an age-structured population, and how do birth and survival rates project the population forward?

Set up a Leslie matrix from age-specific birth (fecundity) and survival rates, multiply it by an age-structure state matrix to project a population forward, and interpret the long-term growth and age distribution
A focused answer to the VCE General Mathematics Unit 4 Matrices key-knowledge point on Leslie matrices. Placing fecundity rates in the top row and survival rates on the subdiagonal, projecting an age-structured population forward, and reading long-term growth and age distribution.
6 min answer →

How are matrices added, multiplied and inverted, and how is a matrix inverse used to solve a system of linear equations?

Perform matrix addition, scalar multiplication and matrix multiplication, find the determinant and inverse of a 2x2 matrix, and use the inverse to solve a system of simultaneous linear equations
A focused answer to the VCE General Mathematics Unit 4 Matrices key-knowledge point on matrix operations. Order and conformability, addition and scalar multiplication, the row-by-column product, the determinant and inverse of a 2x2 matrix, and solving simultaneous equations with the inverse.
6 min answer →

How do you find the greatest flow a network can carry from source to sink, and how does the minimum cut prove the maximum flow?

Model a directed capacitated network with a source and sink, find the maximum flow from source to sink, identify cuts and their capacities, and use the minimum cut to confirm the maximum flow
A focused answer to the VCE General Mathematics Unit 4 Networks key-knowledge point on flow. Capacities, source and sink, finding the maximum flow, defining a cut and its capacity, counting only forward edges, and the maximum-flow minimum-cut result.
7 min answer →

What is a spanning tree, and how does Prim's algorithm find the minimum spanning tree that connects every vertex at least cost?

Identify a tree and a spanning tree in a connected network, apply Prim's algorithm to build the minimum spanning tree of a weighted graph, and find its total weight
A focused answer to the VCE General Mathematics Unit 4 Networks key-knowledge point on minimum spanning trees. The definition of a tree and spanning tree, the n minus 1 edge rule, applying Prim's algorithm step by step, and computing the minimum total weight.
6 min answer →

How does a permutation matrix rearrange the rows of a state matrix, and how are binary matrices used to encode and reorder information?

Recognise and use a permutation matrix as a binary matrix with exactly one 1 in each row and column, apply it to reorder the entries of a state matrix, and identify the matrix that reverses or repeats the reordering
A focused answer to the VCE General Mathematics Unit 4 Matrices key-knowledge point on permutation matrices. The defining one-per-row-and-column structure, using a permutation matrix to reorder a state matrix, the inverse that reverses it, and powers that repeat the reordering.
6 min answer →

How does the Hungarian algorithm assign tasks to workers so the total cost is the lowest possible, using row and column reduction?

Model an allocation problem with a cost matrix and a bipartite graph, apply the Hungarian algorithm using row reduction, column reduction and line covering to find the minimum-cost one-to-one allocation
A focused answer to the VCE General Mathematics Unit 4 Networks key-knowledge point on allocation. The cost matrix and bipartite model, row and column reduction, covering zeros with the fewest lines, the adjustment step, and reading off the minimum-cost assignment.
7 min answer →

How do transition matrices model step-by-step change in a system, and how are future states and steady states found?

Set up a transition matrix to model a Markov system, use it with an initial state matrix to find the state after n steps, identify the steady-state or long-run distribution, and apply a recurrence including the case with additions or removals
A focused answer to the VCE General Mathematics Unit 4 Matrices key-knowledge point on transition matrices. Building a column-based transition matrix, finding the state after n steps, the steady state, and the recurrence model with regular additions or removals.
6 min answer →