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)

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 Ways & Choices worksheet on making decisions. (Getting a job and Apprenticeships).

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

Introduces the major concepts of this section using a map of the london underground.

Lesson plan with activities and value based learning on Decision Making

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

Non-Verbal Reasoning - Advance Practice book

A fancy worksheet the graphically represents the solutions to linear programming problems.

A step by step guide to the simplex algorithm that avoids the complicated language of the textbook.

3 enrichment task that can be used without any prior knowledge. It was used to show year 10's how maths is used through different decision activities

Homework sheets covering Kruskal’s algorithm, Prim’s algorithm, Dijkstra’s algorithm, Chinese Postman algorithm, Travelling Salesman Problem and Critical Path Analysis.

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)

Computers decide what to do by asking questions and determining whether the answers are true or false. Questions that only have two possible answers are called “Boolean expressions”. We will look at the various expressions in the upcoming pages. We will first start off with numbers! What You Get: • Numbers • Variables • Words • Not block • Combining • 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)

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. 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. Understanding and using algorithms Flow charts Bubble sort Quick sort Bin-packing algorithms Order of an algorithm

This is a set of lessons for Decision Mathematics. The resources include Powerpoints and worksheets. Powerpoint include: Learning objectives Examples animated at each step to support explanations and independent learning Important information written in red boxes to scaffold learning. Worksheets include examples on a word document for students to write on. Topics: Spanning Trees Linear Programming Dijkstra’s Algorithm Chinese Postman Problem Travelling Salesman Problem Matching Sorting Algorithms Graph Theory I hope you enjoy these lessons, where they can be used in the following ways: To deliver a course with reduced planning but not reducing quality of the lesson, as this course can be time consuming writing and preparing examples, where this resource can help. As a basis for an observation lesson to save time preparing resources. To give to students for out of lesson learning. To support teachers who are new to this topic, again to reduce planning time.

This is a set of lessons for Decision Mathematics. The resources include Powerpoints and worksheets. Powerpoint include: Learning objectives Examples animated at each step to support explanations and independent learning Important information written in red boxes to scaffold learning. Worksheets include examples on a word document for students to write on. Topics: Spanning Trees Linear Programming Dijkstra’s Algorithm Chinese Postman Problem Travelling Salesman Problem Matching Sorting Algorithms Graph Theory I hope you enjoy these lessons, where they can be used in the following ways: To deliver a course with reduced planning but not reducing quality of the lesson, as this course can be time consuming writing and preparing examples, where this resource can help. As a basis for an observation lesson to save time preparing resources. To give to students for out of lesson learning. To support teachers who are new to this topic, again to reduce planning time.