A presentation introducing prim's and kruskal&'s algorithms.

A Ways & Choices worksheet on making decisions. (Getting a job and Apprenticeships).

Lesson plan with activities and value based learning on Decision Making

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.

DECISION ANALYSIS is one PowerPoint covering one topic of Edexcel’s Further Maths Decision Maths 2 course. There are 7 other PowerPoints covering the other topics (detailed below), which can be bought separately. The whole set of 8 PowerPoints is also available to purchase as a bundle. Each PowerPoint 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.” This PowerPoint is for: DECISION ANALYSIS Other titles in the series are available separately for each of: Dynamic programming Flows 1 Flows 2 Game Theory Hungarian Allocation Algorithm Recurrence Relations Transportation Algorithm Updated 2025

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).

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.

F096 Sexual Health (50) (NEA) – Complete Scheme of Work Unlock high-impact sexual health education with our comprehensive F096 scheme of work! This resource pack gives you everything you need to deliver outstanding lessons on sexual health, tailored for KS4 learners at Lady Manners School and beyond. Designed to save you time and boost student engagement, this pack includes: Full Scheme of Work: Clear, step-by-step guidance for each lesson, mapped to current curriculum requirements and best practice in RSE. Engaging Lesson PowerPoints: Ready-made presentations for every session, packed with discussion prompts, activities, and key information to support confident teaching. Set Assignment (NEA): This year’s Non-Exam Assessment brief and mark scheme—fully editable and aligned with assessment criteria, making moderation and feedback straightforward. Practical Activities and Resources: Worksheets, case studies, and scenarios to help students develop critical thinking and informed decision-making skills around sexual health. Why download? Save planning time with editable, classroom-ready materials Promote inclusive, up-to-date learning that meets statutory RSE guidance Support pupil wellbeing and safeguarding by covering sensitive topics in a structured, age-appropriate way Empower your students with the knowledge and confidence they need for healthy relationships and responsible decision-making. Download the complete F096 Sexual Health (50) (NEA) package today and transform your lessons!

Now you’ve learned the basics of Scratch, you can experiment with some of its more advanced features. The more you practice, the better your coding will become. What You Get: • Things to try • Backpack • Help • Similarities to Python • 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)

Non-Verbal Reasoning - Advance Practice book

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.

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

3 sets of exam questions for the upcoming Decision exam on the 15th June. All answers attached

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 an easy to mark chapter test with answers.

This A-Level Further Maths worksheet for Edexcel Decision 1 is the perfect revision for the Order of an Algorithm. 🟣Edexcel Decision 1 Worksheets🟣 Algorithms Introduction to Algorithms and Flowcharts The Bubble and Quick Sort Bin-Packing Algorithms Order of an Algorithm - Graphs and Networks Graph Theory & Special Graphs - Representings Graphs and Networks Using Matrices The Planarity Algorithm - Exam Revision for Graphs and Networks - This worksheet makes for a great exercise in class as preparation for an exam /testing student understanding on an introduction to graphs and networks. This worksheet is also brilliant for one-to-one tuition. Full solutions are also included as well as a QR code within the worksheet giving video solutions to questions within the worksheet and other similar questions on an introduction to graphs and networks.

A short PowerPoint to explain Algorithms for the A Level Decision Maths (D1) unit of the Further Maths A level course. This is just one PowerPoint - there are a total of 16, available singly or as a bundle, which together cover the full D1 A Level course

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.

Using the London underground to explain the majority of new terminology. The whole of Chapter 2 can be learnt and taught from these resources.