### 25 DAY MATHSFINAL REVISION COURSES

Course Content
1 – Introduction to Vectors
0/17
2 – 1D Horizontal Motion
0/17
3 – Motion due to Gravity
0/10
4 – Continuous Change (Calculus)
0/13
5 – Forces and Systems
0/18
6 – Introduction to Energy and Momentum
0/8
7 – Impacts and Collisions
0/8
8 – Uniform Circular Motion
0/11
9 – Difference Equations
0/11
10 – Introduction to Graph Theory
0/8
11 – Path Optimisation
0/7
12 – MST Optimisation
0/4
13 – Project Optimisation
0/11
Digital Lessons

## Overview

$\,$

The length of time that we recommend members of each team spend on this topic are as follows:

$\,$

Alpha – 8 days

Bravo – 6 days

Charlie – 5 days

Delta – 4 days

Echo – 3 days

$\,$

## Learning Objectives

State what is meant by a tree

State what is meant by a spanning tree

Find all of the spanning trees of a given network

State what is meant by a minimum spanning tree

Find the minimum spanning tree(s) of a network using Kruskal’s Algorithm

Find the minimum spanning tree(s) of a network using Prim’s Algorithm

Find the distance matrix for a given network and vice versa

Find the minimum spanning tree(s) of a network using a given distance matrix

Describe when each minimum spanning tree algorithm should be used

$\,$

## Keywords

tree

spanning tree

minimum spanning tree

Kruskal’s Algorithm

Prim’s Algorithm

distance matrix

sparse network

dense network

$\,$