Worksheet 2 - Paper Rounds (Network Problems) A network problems worksheet including a paper round problem. Ideal for use an introductory task/homework, this worksheet demonstrates a real world example of network problems. Curriculum areas: • Understand the language of networks including node, arc and weight • Use networks to model the connections between objects This pack includes:  Cover Sheet  Student worksheet  Answer Sheet Network Problems are frequently solved using Operational Research (OR). For more information visit our website: theorsociety .com

These PowerPoints form full lessons of work that together cover the new AS level Further Maths course for the AQA exam board. Together all the PowerPoints include; • A complete set of notes for students • Model examples • Probing questions to test understanding • Class questions including answers • Individual whiteboard work • Links to exercises in ‘AQA approved textbooks by Camb uni Press’ these can easily be edited for your textbook The PowerPoints can be used in the lesson and also given to students that have missed a lesson I have added ‘Further Maths 5 - Matrices Transformation’ and ‘Further Maths 23 - Network Flows’ for free download Please leave a review as it will really help me to improve my resources Spanning trees Prims, Kruskals covers; Solve network optimisation problems using spanning trees Prims algorithm Kruskals algorithm Using adjacency matrices to solve network optimisation problems

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, The travelling salesman problem. 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. The classical and practical travelling salesman problem Using a minimum spanning tree to find an upper bound Using a minimum spanning tree to find a lower bound Using the nearest neighbour algorithm to find an upper bound

Powerpoints and Notebook presentations that show learners how to complete the minimum connector problems using Prims and Kruskals algorithm. A presentation of how to use Travelling salesperson algorithm to find a complete cycle. SMART Notebook Express presentations can be used for free by using SMART online or by downloading SMART software, also free, I use it because it allows a more interactive presentation than a powerpoint. Just search 'SMART Notebook Express' and try it with my free SMART resource.

A PowerPoint demonstrating the use of the matrix method for Prim’s Algorithm. A video demonstrating the use of the PowerPoint can be found at the address below: https://youtu.be/lebeO26FuMk

Covering Prim's and Kruskal's Algorithms

Algorithm information pack - a handy resource for revision or moments where students need reminding how to apply certain algorithms. Algorithms are frequently used in Operational Research (OR). For more information visit our website: theorsociety .com

Discrete 1 - Decision 1 - Prim's Algorithm - Kruskal's Algorithm - Minimum connector - Minimum spanning tree - Matrix Prim - Worksheet with 14 questions to be completed on the sheet - solutions included

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

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Prim’s Minimum Spanning Tree Algorithm. Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach, suitable for teaching or for students to use as revision at their own pace. Includes a handy flowchart for revision. 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

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Kruskal’s Minimum Spanning Tree Algorithm. Primarily written for Edexcel but suitable for OCR specifications. Complete, step-by-step approach, for teaching and for students to use as revision at their own pace. Includes a handy flowchart for revision. 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

Including Gantt charts and Scheduling. Everything you need to teach chapters 4 and 5 in Decision 1.

Everything you need to teach the Matchings Chapter in Decision 1. Short chapter so smaller resources than the others.

The Maths Zone series is designed to add some fun to the traditional strands of the mathematics curriculum by presenting challenging activities and humorous problems to students in a meaningful context. The worksheets are a mix of traditional algorithms and puzzle sheets and are completely original in nature, offering the novelty of a new approach. Classroom teachers and remedial teachers will find this book to be a valuable mathematical resource. Activities can be used as early finisher tasks, whole class lessons, practice and consolidation tasks or as small group challenges. All activities are linked to relevant mathematics outcomes. Mathematical Reasoning contains sections covering logical reasoning, equations, Venn diagrams and other problem solving strategies. Also included are challenging games and activities that explore a variety of mathematical concepts that are based on versions of popular everyday games such as Dominoes, Bingo and calculator activities. This is a Photocopy Master ebook (56 pages) and activity pages may be photocopied for use in the classroom. Our ebooks are in pdf format. Edubooks is an imprint of Ready-Ed Publications. Author: Edward Connor

A great resource for A level students on Decision maths. Specifically for AQA but can be used for all other exam boards as well. Provides quick, easy to understand information for the topics. Has many uses including as flashcards, posters, powerpoint presentation for revision and introduction of decision topics. A great and very helpful resource

A Powerpoint game that can be used to help engage students in D1 and D2. Although it is made with the travelling salesperson algorithm in mind, it can also be used for Kruskal's, Prim's on a distance matrix and the nearest neighbour algorithm.