This is the fourth in a series of short Professional Development (PD) courses aimed at introducing the new content in the stage 6 mathematics curriculum.
The first class will run for three months from 1 January 2018 until 31 March 2018.
By the end of the course you will be comfortable with the terminology we use to discuss networks. You will understand some important concepts and practice some algorithms which are used to find interesting structures within networks. You will see some examples of how you can deliver this content to your students.
This course will run for three months.
TQI/NESA accreditation for this course is pending. This course meets the Australian Professional Standards for Teachers standards 2.1.2 and 2.5.2.
The course will cover all the content from MS1: Networks and Paths, as described on the NESA website, including the following concepts:
* networks, vertices, edges, degrees,
* walks, paths, cycles, trees, spanning trees,
* minimal spanning trees, shortest paths.
The course also covers the following algorithms (procedures):
* Kruskal's algorithm, for finding minimal spanning trees,
* Prim's algorithm, for finding minimal spanning trees,
* Dijkstra's algorithm, for finding shortest paths from a given vertex.