1. Resources Home
2. High School
3. Math
5. Finding the shortest path

#### Edexcel Decision 1 Summary Revision

Booklet summarising Edexcel Decision 1 laid out like the textbook including worked through examples and key points. Perfect for students learning at A-Level looking for a booklet to help summarise all of Decision 1.

#### DECISION MATHEMATICS A LEVEL: DIJKSTRA

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

#### Unconstrained Optimization

Unconstrained Optimization is one of the topic which is covered during Mathematics lectures and seminars in order to enhance students knowledge. During this Lecture and Seminar we are covering following subtopics (Agenda): •Intervals of increase and decrease •Concavity and convexity •Critical and stationary points •Optimization of economic functions In this File you will find: - 1 Unconstrained Optimization Lecture Power Point Presentation 28 Slides - 1 Seminar Plan - 19 Seminar Activities with full answer list for students All covered materials are taught for bachelor level students Level 3. Please write your comments once you purchase this lesson in order to have some suggestions for further improvements of teaching materials.

#### Decision 1 Revision Resources

A selection of D1 revision resources for the AQA A-Level Spec. These resources include revision sheets and posters with fill in the gaps to help student remember the information. These sheets cover the sorting algorithms, definitions for D1 and other algorithms.

#### Edexcel AS Further Decision Mathematics 1

A series of lesson sheets that take you through the whole of the Edexcel AS Further Decision Maths 1 course. They are intended to be used in the order they are numbered. When used in conjunction with exercises on the topics these deliver the entire content of the course.

#### BTEC Level 3 ICT/Computer Science Unit 26 Whole Unit Pack (Mathematics for IT Practitioners)

Contains presentations and assignments to deliver the unit. All resources and assignments have passed SV twice and contain all relevant learning criteria for the unit. Can be used for A Level and GCSE Computer Science lessons as well.

#### Dijkstra and A* Algorithm Spreadsheets. Example and step by step explanation

Couple of spreadsheets to aid teaching of Dijkstra's shortest path algorithm and A* algorithm. Example and step by step explanation included. Tried to make it as self explanatory as possible so can be given straight to the pupils whilst you explain it etc.

#### Decision Maths

Presentations that cover the majority of A level decision maths units

#### Decision 1 Chapter 3 Minimum Spanning Trees

SMART notebook file guiding through Decision 1 Chapter 3 MSTs with notes and examples. Includes: Kruskal, Prim, Prim on a Matrix, Dijkstra

#### D1/ D2 - Travelling Salesperson game

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.

#### Decision 1 - All lessons and resources for all chapters

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 all chapters: Algorithms, Networks, Route Inspection, Critical paths, Linear Programming and Matchings Includes all worksheets, answers and assessments

#### Decision Maths Enrichment

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