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.

fractions. year 2.

Designed for GCSE/A-Level students who are taking computer science. Helpful also for A-Level maths students. It is a self-marking excel sheet that will test students on insertion sort and merge sort, giving them an outline for how to write the answers to such questions in exams. In the top left corner there is a cell to input a number, by inputting this number, it will change the values in the insertion/merge sort question.

Using the games most popular icons to fill in 4x4, 6x6 and 9x9 Sudoku squares, Fortnite gamers can: IMPROVE THEIR CONCENTRATION DEVELOP PROBLEM SOLVING SKILLS IMPROVE LOGICIAL THINKING REDUCE ANXIETY AND STRESS GET A SENSE OF ACCOMPLISHMENT 60 pages of puzzles and hours of FUN Ages 6-12 Answers included

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

A fun classroom activity to practise connects fractions, decimals & percentages. Students colour the matching fraction, decimal & percentage with the same colour. The answer key is also included. The activity in two formats: Printable and PowerPoint and in British and American English. Skills Level: Beginner (Easy) Grades: 4th to 8th Learning Outcomes: – Connect fractions, decimals and percentages and carry out simple conversions. Also comply with Australian Curriculum: Connect fractions, decimals and percentages and carry out simple conversions (ACMNA157) More Resources: Colouring Pages Fun Activity Topics: Numbers Times Table Fractions Decimals Percentages Significant Figures Consumer Maths Financial Maths Algebra Pythagoras Theorem Measurement and Geometry Visit my shop :)

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

When I had to teacher Floyd’s algorithm for the first time, I found that the available resources made it seem more difficult than it really was. This is because of unclear descriptions within the textbook about how to work simultaneously with both a distance and route tables. I therefore decided to create this fully animated PowerPoint presentation that clearly shows how the two tables are simultaneousily managed as you work towards the final solution. The 31 slides are the result of many hours of using PowerPoint’s more advanced features to provide a detailed explanation of the algorithm by working through every step of a typical example question. (Students will not realise that so many slides are being used “behind the scene”.) I have also provided extensive teacher notes throughout the slides. I have made full use of PowerPower’s animation features to bring the algorithm to life. Each decision about updating the distance and route tables is clearly shown, and the updates are done using “fade in”, “fade out” and “motion path” animations. Once the final distance and route tables are achieved, I dynamically build the optimised routes from the information in the route table. The presentation could be given to students as a self-paced learning task, or used as the centrepiece of a teacher led lesson. I have provided a free preview PowerPoint Slideshow so that you can see how clear Floyd’s Algorithm becomes once you make each decision more dynamic, explicitly showing how the distance and route tables are simultaneously updated. I hope you find this resource very useful. I am happy to act upon any feedback you have as to how I could further improve it. Regards Gerard

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.

This file is a collection of examples and workings that accurately teach the basics of computation theory and Turing machines.

Dijkstra’s Algorithm The way I would run this is to talk through the motivation for the algorithm from the presentation, and give the terminology worksheet to be filled in (answer in the presentation). We’d then work through the brute force worksheet. I might then run through the example, then give them the simple graph to fill in. Than we would work through TaskGraph1 for the graphs. Then I might get them to either code, or come up with graphs for them to solve in small groups or in pairs. Included: TPT presentation Labels to fill in worksheets to give structure for the students to fill in answers TaskGraph1 3 graphs to run Dijkstras on. AnswerGraph1 and 2 -answers for the graphs Brute force worksheet and brute force worksheet answers

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

A PowerPoint demonstrating the use of Dijkstra’s Algorithm. A video showing the use of the presentation can be found at the address below: https://youtu.be/tgp9I_K_WqU

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

This PowerPoint provides an example of the Route Inspection algorithm being used. There is a video of the PowerPoint being used available at the address below: https://youtu.be/958NcfRL4GQ

A PowerPoint demonstrating how to use the Planarity Algorithm for Decision Maths. A video of the presentation being used can be found at the address below: https://youtu.be/nXGtrrq23z0

Discrete 1 - Decision 1 - Sorting algorithms - bubble sort - shuttle sort - Worksheet with 12 questions to be completed on the sheet - solutions included

This sheet gives links to videos on all 14 of the algorithms that are required for the Edexcel Decision Maths 1 module. Each video gives a demonstration of an individual algorithm, and can be shared with students as a revision resource or used as part of a teaching lesson. Each video can obviously be paused whilst the students work out what is coming next, or rewound to hear an explanation again. The algorithms are: Full Bin, First Fit, First Fit Decreasing, Bubble Sort, Quick Sort, Binary Search, Kruskal's, Prim's, Prim's - Matrix Method, Dijkstra's, Route Inspection, Maximum Matching, Finding Critical Paths and the Scheduling Procedure.

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