pptx, 116.53 KB
pptx, 116.53 KB

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Kruskal’s Minimum Spanning Tree Algorithm.

Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach, for teaching and for students to use as revision at their own pace. Includes a handy flowchart for revision.

The full set of 16 PowerPoints in this series cover the whole of the Edexcel D1 course:

Algorithms
Bin-Packing Algorithm
Critical Path Analysis (GANTT)
Dijjkstra’s Shortest Path Algorithm
Floyd’s shortest distance algorithm
Graphs & Networks
Kruskal’s Minimum Spanning Tree
Linear Programming
Planarity Algorithm
Prim’s Minimum Spanning Tree
Route Inspection Algorithm
Simplex Algorithm 1 - Edexcel tableau
Simplex Algorithm 2 (artificial variables) - Edexcel tableau
Simplex Algorithm 3 (Big M method) - Edexcel tableau
Sorting Algorithm: Quick-sort, Bubble-sort (& Shuttle-sort for OCR)
Travelling Salesperson Problem, including Nearest Neighbour Algorithm (+ tour improvement algorithm for OCR)

Updated 2022

Reviews

Something went wrong, please try again later.

This resource hasn't been reviewed yet

To ensure quality for our reviews, only customers who have purchased this resource can review it

Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.