Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Linear Programming. Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach with worked examples of A Level standard. Format is such that students can also use as revision at their own pace and 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

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Algorithms. Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach with worked examples of A Level standard. Format is such that students can also use as revision at their own pace and 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

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Bin-packing Algorithm. Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach with A Level standard examples. Format is such that students can also use as revision at their own pace and 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

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Prim’s Minimum Spanning Tree Algorithm. Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach, suitable for teaching or 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

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

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Graphs & Networks. Primarily written for Edexcel but suitable for OCR specifications. Complete, definitions for all aspects of Graphs & Networks. Step-by-step approach which can be used for teaching and for students to use as revision at their own pace. Includes a handy summary to aid learning. 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

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Sorting Algorithms. Primarily written for Edexcel but with added content to support OCR specifications. Complete, step-by-step approach with worked examples of A Level standard. Format is such that students can also use as revision at their own pace and includes handy flowcharts 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

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Dijkstra’s Algorithm. Primarily written for Edexcel but suitable for for OCR specifications. Complete, step-by-step approach with worked examples of A Level standard. Format is such that students can also use as revision at their own pace and 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

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Algorithms. Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach with worked examples of A Level standard. Format is such that students can also use as revision at their own pace. 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