pptx, 88.84 KB
pptx, 88.84 KB
pptx, 178.5 KB
pptx, 178.5 KB
pptx, 524.3 KB
pptx, 524.3 KB
pptx, 250.39 KB
pptx, 250.39 KB
pptx, 158.1 KB
pptx, 158.1 KB
pptx, 116.53 KB
pptx, 116.53 KB
pptx, 704.19 KB
pptx, 704.19 KB
pptx, 330.23 KB
pptx, 330.23 KB
pptx, 290.26 KB
pptx, 290.26 KB
pptx, 353.21 KB
pptx, 353.21 KB
pptx, 300.93 KB
pptx, 300.93 KB
pptx, 271.91 KB
pptx, 271.91 KB
pptx, 195.91 KB
pptx, 195.91 KB
pptx, 454.59 KB
pptx, 454.59 KB
pptx, 474.29 KB
pptx, 474.29 KB
pptx, 180.48 KB
pptx, 180.48 KB

PowerPoints to teach the full A Level Further Maths Decision/Discrete Maths course (Edexcel)

Primarily written for Edexcel but suitable for much of the OCR specifications. The set of 16 PowerPoints contains complete, step-by-step instructions and A Level standard examples. These may be used for both teaching and for student revision.

Decision Maths is a module that lends itself to PowerPoint instruction – networks grow and develop as information is added, and these PowerPoints model this in real time.
Having developed these as a teaching resource, I find the course can be taught in a substantially reduced time, leaving more time for consolidation and practice or for teaching other FM options. My students take no notes in class but, once taught, use the PowerPoints as reminders and revision as they practise. Most PowerPoints contain a handy flowchart for in-class prompts or for private revision. When used under the previous, modular, A Level specification, this module was consistently the highest-scoring module for my students.]

“S”, year 12, says: “I find these PowerPoints really visual – I can see what is happening. It makes the process of learning much quicker and easier to understand, and I like the fact that I can always go back and replay the lessons, which is helpful. I find them very useful for revision.”

The full set of 16 PowerPoints consists of:
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

Review

5

Something went wrong, please try again later.

eca00ril

3 years ago
5

This is an amazing resource, thank you so much for sharing. It’s saved time in lessons for the students and includes really useful sequential notes and examples which worked very well. Have you made any for Core Pure?

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.