The “if” blocks use Boolean expressions to decide what to do next. To use them, put other blocks inside their “jaws”. The blocks inside the “if” blocks will only run if the answer to the Boolean expression is true.
What You Get:
• Making Decisions
• Decision Blocks
• If Then
• Branched Instructions
• Boolean Shapes
• Next Steps
My Scratch Resources:
This resource is part of a numbered set. It can be used separately or in conjunction with my other Scratch resources.
This resource can be bought in a bundle here. Other Resources in this set include the following:
• Scratch: Binary (Advanced #1)
• Scratch: Decisions (Advanced #2)
• Scratch: Sensing and detecting (Advanced #3)
• Scratch: Complex loops (Advanced #4)
• Scratch: Sprite Communication (Advanced #5)
• Scratch: Creating Blocks (Advanced #6)
• Scratch: Monkey vs Bat - Game Programming (Advanced #7)
• Scratch: Things to try (Advanced #8)
• Scratch Bundle: Advanced To Your Third Game (Value Pack)
PowerPoints to teach the full A Level Further Maths Decision Maths D2 course (Edexcel)
The set of 8 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 8 PowerPoints consists of:
Decision Analysis
Dynamic programming
Flows 1
Flows 2
Game Theory
Hungarian Allocation Algorithm
Recurrence Relations
Transportation Algorithm
Updated 2022
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
PowerPoints to teach the full A Level Further Maths Decision Maths D2 course (Edexcel)
Recurrence Relations
The set of 8 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 8 PowerPoints consists of:
Decision Analysis
Dynamic programming
Flows 1
Flows 2
Game Theory
Hungarian Allocation Algorithm
Recurrence Relations
Transportation Algorithm
Updated 2022
PowerPoints to teach the full A Level Further Maths Decision Maths D2 course (Edexcel)
The set of 8 PowerPoints contains complete, step-by-step instructions and A Level standard examples. These may be used for both teaching and for student revision.
This PowerPoint teaches the Hungarian Allocation Algorithm
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 8 PowerPoints consists of:
Decision Analysis
Dynamic programming
Flows 1
Flows 2
Game Theory
Hungarian Allocation Algorithm
Recurrence Relations
Transportation Algorithm
Updated 2022
PowerPoints to teach the full A Level Further Maths Decision Maths D2 course (Edexcel)
Transportation Algorithm
The set of 8 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 8 PowerPoints consists of:
Decision Analysis
Dynamic programming
Flows 1
Flows 2
Game Theory
Hungarian Allocation Algorithm
Recurrence Relations
Transportation Algorithm
Updated 2022
PowerPoints to teach the full A Level Further Maths Decision Maths D2 course (Edexcel)
Flows 1
The set of 8 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 8 PowerPoints consists of:
Decision Analysis
Dynamic programming
Flows 1
Flows 2
Game Theory
Hungarian Allocation Algorithm
Recurrence Relations
Transportation Algorithm
Updated 2022
PowerPoints to teach the full A Level Further Maths Decision Maths D2 course (Edexcel)
Dynamic Programming
The set of 8 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 8 PowerPoints consists of:
Decision Analysis
Dynamic programming
Flows 1
Flows 2
Game Theory
Hungarian Allocation Algorithm
Recurrence Relations
Transportation Algorithm
Updated 2022
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.
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.
A set of powerpoints covering all topics in D1. Examples labelled WB correspond to the separately attached 'Workbook&' (I give this as a single booklet so pupils have a clear model answer to each topic). References to Exercises are from the Pearson Edexcel D1 textbook.
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
Full lesson on Dijkstra's algorithm for finding the shortest path in a network. Fully animated powerpoint takes students slowly through the process of labelling the nodes and selecting which nodes will form part of the solution. The lesson resource is fully write-on and will only need printing (answers are included). There is another resource which covers more basic practice questions (with answers given).
Simple loops are used to repeat parts of a program forever, or a certain number of times. Other, cleverer loops can be used to write programs that decide exactly when to repeat instructions.
What You Get:
• Repeat Until
• Stop All
• Wait
• Nested Loops
• Next Steps
My Scratch Resources:
This resource is part of a numbered set. It can be used separately or in conjunction with my other Scratch resources.
This resource can be bought in a bundle here. Other Resources in this set include the following:
• Scratch: Binary (Advanced #1)
• Scratch: Decisions (Advanced #2)
• Scratch: Sensing and detecting (Advanced #3)
• Scratch: Complex loops (Advanced #4)
• Scratch: Sprite Communication (Advanced #5)
• Scratch: Creating Blocks (Advanced #6)
• Scratch: Monkey vs Bat - Game Programming (Advanced #7)
• Scratch: Things to try (Advanced #8)
• Scratch Bundle: Advanced To Your Third Game (Value Pack)