ACMGM106
use ESTs and LSTs to locate the critical path(s) for the project
ACMGM106 | Content Descriptions | Unit 4 | General Mathematics | Mathematics | Senior secondary curriculum
ACMGM102
identify a minimum spanning tree in a weighted connected graph either by inspection or by using Prim’s algorithm
ACMGM102 | Content Descriptions | Unit 4 | General Mathematics | Mathematics | Senior secondary curriculum
ACMGM111
determine the optimum assignment(s), by inspection for small-scale problems, or by use of the Hungarian algorithm for larger problems.
ACMGM111 | Content Descriptions | Unit 4 | General Mathematics | Mathematics | Senior secondary curriculum
ACMGM110
use a bipartite graph and/or its tabular or matrix form to represent an assignment/ allocation problem; for example, assigning four swimmers to the four places in a medley relay team to maximise the team’s chances of winning
ACMGM110 | Content Descriptions | Unit 4 | General Mathematics | Mathematics | Senior secondary curriculum