All presentations for Edexcel A-level Further Maths Decision 1 teaching.
All presentations use animations, simple layouts, graphics and diagrams to clearly explain all topics required for a full understanding of Decision Year 1. This is completely in-line with the Edexcel A-level Further Maths specification.
teachingisgood is happy to declare that they also include loads of practice questions, which build up a key understanding and build exam skills, as well as exam-style questions which push problem solving skills with questions aimed at the highest achieving students.
To further test students’ understanding, presentation also have animations, videos, interactive slides, and mini-quizzes on a range of key topics which have a difficult core content.
Couple of spreadsheets to aid teaching of Dijkstra's shortest path algorithm and A* algorithm.
Example and step by step explanation included. Tried to make it as self explanatory as possible so can be given straight to the pupils whilst you explain it etc.
A booklet summarising Edexcel Decision 1. Includes all 7 modules (algorithms, graphs & networks, algorithms on networks, route inspection, critical path analysis, linear programming and matchings). Following the same layout as the textbook, it’s perfect for those who are visual learners or don’t like working from thick textbooks. It includes worked-through examples and key points for every module. Perfect for students learning at A-Level looking for a booklet to help summarise all of Decision 1. Also really good for exam revision and trying to re-jog memories without the overwhelming feeling of going through a full textbook.
This is a PowerPoint presentation which uses animation, simple layouts, graphics and diagrams to clearly explain all topics required for a full understanding of Decision Maths Year 1, Algorithms on graphs. This is completely in-line with the Edexcel A-level Further Maths specification.
teachingisgood is happy to declare that this presentation also includes loads of practice questions, which build up a key understanding and build exam skills, as well as exam-style questions which push problem solving skills with questions aimed at the highest achieving students.
This presentation is part of a series of presentations for A-level Further Maths, some of which also include interactive quizzes, videos and fun ways to test students and develop knowledge.
The topics covered in this presentation is as follows.
Kruskal’s algorithm
Prim’s algorithm
Applying Prim’s algorithm to a distance matrix
Using Dijkstra’s algorithm to find the shortest path
Floyd’s algorithm
PowerPoints written so that a teacher can learn from the PowerPoints and teach from them. Students can use the PowerPoints to learn independently too. Many colleagues have used my lessons on Decision 1 without a strong understanding of Decision themselves.
Includes all chapters: Algorithms, Networks, Route Inspection, Critical paths, Linear Programming and Matchings
Includes all worksheets, answers and assessments
Dijkstra’s Algorithm
The way I would run this is to talk through the motivation for the algorithm from the presentation, and give the terminology worksheet to be filled in (answer in the presentation). We’d then work through the brute force worksheet. I might then run through the example, then give them the simple graph to fill in. Than we would work through TaskGraph1 for the graphs. Then I might get them to either code, or come up with graphs for them to solve in small groups or in pairs.
Included:
TPT presentation
Labels to fill in worksheets to give structure for the students to fill in answers
TaskGraph1 3 graphs to run Dijkstras on.
AnswerGraph1 and 2 -answers for the graphs
Brute force worksheet and brute force worksheet answers
A PowerPoint demonstrating the use of Dijkstra’s Algorithm. A video showing the use of the presentation can be found at the address below:
https://youtu.be/tgp9I_K_WqU
This is a ready to teach lesson on Floyd’s Algorithm, covering:
How to implement the algorithm (with an example for students to work through at the same time as you go through it on the board).
How to find the shortest route
How to find the order of the algorithm
The lesson is 57 PPT slides long, with one example for students and one question (with solutions provided).
If you have any suggestions or complaints about this resource, or a request for other resources, do not hesitate to contact me via lastminutemathslesson@gmail.com.
Thanks!
Chris @ Last Minute Maths
This is a powerpoint covering all areas of Decision 1 (I realise they are only putting it in further maths from 2017). It contains brief notes by way of an explanation, model answers to questions and a question or two for the students to do; all of the questions come with answers that you can display when ready. The slide show comes with a progress grid (regularly referred to in the presentation) so that students can mark their progress from start to finish and pinpoint any areas that may need extra work with a “red/amber/green” system that they fill in. It’s what I use in my lessons before setting tasks from worksheets or text books to practice.
Created from looking at the Islands around Auckland, for the pupils to see where they can sail between, and if it is a Eulerian circuit or path, or neither.
Focus given to the context of the question to draw the use of the topic.
Decision Maths 1 - Shortest Path Algorithm A Powerpoint 97-2003 demo of Dijkstra’s algorithm for finding the shortest path in a network. Updated 18/02/10 to correct slight error in path order.
Contains presentations and assignments to deliver the unit.
All resources and assignments have passed SV twice and contain all relevant learning criteria for the unit.
Can be used for A Level and GCSE Computer Science lessons as well.
Powerpoints on upper,lower bounds, tracing algorithms and Chinese postman ideal for AQA specification.
Also attached linear programming powerpoint and in class notes/lessons for whole course
68% saving!
Two resource packs that contain all the PowerPoints required to teach the full modules for FP2 and S2 for MEI OCR.
Revision PowerPoints are also contained in these resource packs.
I have also included D1 revision questions which can be used for the new maths A Level.
I have also included Statistics revision worksheets which can be adapted for the new maths A Level.
PowerPoints to teach the full A Level Further Maths Decision/Discrete Maths course (Edexcel)
Floyd’s shortest distance algorithm
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