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.

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 Travelling salesman problem covers; Find and interpret upper bounds and lower bounds for the Travelling Salesman problem Evaluate, modify and refine models which use networks Using adjacency matrices to solve travelling salesman problem

This is a 50 slide PowerPoint presentation covering the content of Chapter 5 of Edexcel’s A-Level book “Decision Mathematics 1” (2017+ specification). This includes: Minimum Spanning Tree (Upper Bound) Looking for Shortcuts Residual Minimum Spanning Tree (Lower Bound) Nearest Neighbour (Upper Bound) [ I have also uploaded a free preview of this presentation to the TES website.] The slide set makes extensive us of PowerPoint animations to clearly explain the involved algorithms. I have provided teacher notes for most slides. I have used an extended practical example throughout the presentation relating to a band’s (XTC) actual tour of the UK in 1979. The intent is to emphasis that the algorithm has practical uses in the real world. Required terminology is revised, as is Kruskal’s and Prim’s algorithm’s for finding a Minimum Spanning Tree (MST). I hope you find the PowerPoint presentation useful within your teaching. Regards Gerard

Worksheet 3 - Courier Service (Travelling Salesperson) A travelling salesperson problem based around a courier service. Ideal for use an introductory task/homework, this worksheet demonstrates a real world example of the travelling salesperson problem. Curriculum areas covered: • Travelling salesperson problem • Determination and interpretation of upper bounds • Determination and interpretation of lower bounds • Real world factors that may influence the problem This pack includes:  Cover Sheet  Student worksheet  Answer Sheet Network problems are frequently encountered in Operational Research (OR). For more information visit our website: theorsociety .com

financial mathematics, profit and loss, percentage loss, percentage profit, change, exchange, cost, expenses, expenditure, items, accounting

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

Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Travelling Salesperson Algorithm. 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 and includes a handy flowchart for revision. Includes Tour Improvement Algorithm for OCR. 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

Decision Maths 1 Chapter 5: Traveling Salesman PowerPoints for sections 5.2, 5.3 and 5.4 in Pearson’s Decision Maths 1 Textbook

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

The Powerpoint shows how to use the minimum spanning tree method to find a lower bound for the Travelling Salesman Problem. There is a video showing its use available at the address below: https://youtu.be/VcugXirtWOo

The Powerpoint shows how to use the minimum spanning tree method to find an upper bound for the Travelling Salesman Problem. There is a video showing its use available at the address below: https://youtu.be/xN9ZtYzPewg

This PowerPoint will guide you through the process of finding an upper bound for the Travelling Salesman Problem using the Nearest Neighbour method. This was created with the Edexcel A Level Further Maths course in mind, but it should be suitable for others too. There is a video of the powerpoint in use at the link below: https://youtu.be/ojjnd5gEMuk

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

These questions are based on the 2018 Data Sheet for the Decision Maths unit of AQA Use of Maths (pilot). They are designed to help students prepare for the exam and to familiarise them with the contexts in the data sheet. Solutions are included.

This is a 24 slide free, sample preview of my 50 slide PowerPoint presentation covering all the content of Chapter 5 of Edexcel’s A-Level book “Decision Mathematics 1” (2017+ specification). This includes: Minimum Spanning Tree (Upper Bound) Looking for Shortcuts Residual Minimum Spanning Tree (Lower Bound) Nearest Neighbour (Upper Bound) The slide set makes extensive use of PowerPoint animations to clearly explain the involved algorithms. I have provided teacher notes, where necessary, for each slide. I have also used an extended practical example throughout the presentation relating to band’s (XTC) actual, short tour of the UK in 1979. The intent is to emphasis that the algorithm has practical uses in the real world. Necessary terminology is revised, as is Kruskal’s and Prim’s algorithm’s for finding a Minimum Spanning Tree (MST). I hope you find the PowerPoint presentation useful within your teaching. Regards Gerard

This is a lesson intended to introduce pupils to Eulerian Networks. The lesson was initially delivered as part of an Year 7 ‘Welcome Week’ at the school. During the week there was a focus of Community and how Mathematics can be applied outside of the classroom. Although delivered to Year 7 classes, the mathematics can still be used higher in the school and beyond. It may also be an interesting activity to use with classes at the end of term as a ‘one-off’ lesson.

Ymarfer Mathemateg Safon Uwch ar thema’r Nadolig yn cynnwys mathemateg sy’n seiliedig ar benderfyniadau, hafaliadau gwahaniaethol ac integriadau. Dyma ychwanegiad tymhorol at ein hadnoddau ar-lein a baratowyd gan Adran Fathemateg Prifysgol Aberystwyth Dim ond un o’r gwasanaethau Estyn Allan rhad ac am ddim y mae Prifysgol Aberystwyth yn ei gynnig i ysgolion ac athrawon yw hwn I gael rhagor o wybodaeth, ewch i: https://fbaps-outreach-hub.dcs.aber.ac.uk/indexCy.html