#### Eulerian Networks

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.

#### Collaborative Inquiry with Peer Review: Deep Learning

This assessment item nurtures collaborative inquiry with peer review and teacher validation.

#### Order of an Algorithm questions, Decision

A set of questions I have written regarding how to find the order of an algorithm (be it linear, quadratic, exponential etc.) for the EDEXCEL 2017 spec further maths Decision module.

#### Investigation: A Borderline Case

A Mathematical Investigation Assessment Item for Years 9-11 looking at Nearest-Neighbour Iteration.

#### 2018 FIFA WORLD CUP

This bundle includes 4 seperate Maths lessons with mark schemes and follow up moving on comments. Save yourself some money by buying them all together rather than seperately!

#### FIFA 2018 WORLD CUP WORKSHEET WITH MARK SCHEME

(It does look a bit strange that some of the writing doesnt fit in the box properly on the LO but this is just in the preview, it will be all lined up when you download) Attached is the official FIFA rankings as of the 4th June 2018. The children must use this information to solve the variety of mathematical problems. Brilliant KS2 lesson in the run up to the world cup. I also did a follow up lesson where the children had to produce a bar chart of the top 5 teams in the world and then 5 teams of their choice - they absolutely loved it. This resource also includes a mark scheme and a feedback questions to reduce your workload! Enjoy! Once downloaded this is editable through microsoft word to make it easier/harder to suit your class.

#### OCR MEI FP2 & S2 Full SOW + D1&S1 Revision

75% saving! Two resource packs that contain all the PowerPoints required to teach the full modules for FP2 and S2 for MEI OCR. Revision PowerPoints are also contained in these resource packs. I have also included D1 revision questions which can be used for the new maths A Level. I have also included Statistics revision worksheets which can be adapted for the new maths A Level.

#### Decision Revision Questions

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

#### Insertion Sort and Merge Sort Self-Marking Questions

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.

#### Discrete Maths OCR - Graphs

New Further Maths A Level (2017 syllabus) - Discrete Maths. Covers 7.02 Graphs (Year 2). Under each part of the specification are explanations, examples, exercises and solutions covering bipartite graphs and colouring arguments, Hamiltonian graphs, Ore’s theorem, planarity, Euler’s formula, Kuratowski’s theorem and thickness. 32 pages.

#### Decision Maths Homework Sheets

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

#### AQA Use of Maths (pilot) booklets for USE 1, Data, Decision

Notes and examples are provided for all topics in these three units of the AQA Use of Maths (pilot) syllabus.

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

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

#### Easy Snake / Logic Based Game

Looking for activities to motivate your kids to count and think strategically? Easy Snake is a logic based game that is a great tool for building foundation maths skills. For example, Easy Snake may encourage kids to: consider the concept of rules, practice following rules, detect patterns, plan ahead, predict the outcome of alternative moves, learn from experience How it works: 1. Download the program to your desktop (you don’t need to install it). 2. Double-click on the new Easy Snake icon on your desktop to start. ⓘ Easy Snake is compatible with the following browsers: Chrome, Firefox, Edge and Opera.

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

#### Resources to teach, practise and revise sorting and packing algorithms (D1)

These resources save a lot time as they have ready-made examples you can project onto a board and students can work on the printable worksheets which saves them copying down questions and makes lesson time more productive. The resources cover bubble sort, shuttle sort and the first-fit algorithm. There are also resources which explain how to measure and compare the efficiency and order of algorithms. All answers are included to the exercises and revision material. Note that these resources were created for the OCR D1 module (4736) but would be useful resources for anyone teaching the algorithms mentioned.

#### Revision material for sorting and packing algorithms (Decision maths D1 - OCR 4736)

These resources are a great way for your students to revise the key points they need to remember and understand about bubble sort, shuttle sort and the first-fit algorithms. The multiple choice questions are a quick way to check/revise the key knowledge, or this could be used as a quick assessment (answers provided) The sorting and packing practice worksheet has 2 pages of examination-style questions for students to attempt (worked answers included). The final resource is a 4-page document starting with all the required knowledge and skills listed on the first page, followed by 2 pages of examination-style questions (worked answers provided).

#### Resources on comparing the efficiency and order of algorithms (Decision maths D1 - OCR 4736)

These resources can be used to introduce how the efficiency of algorithms can be compared and measured. In the first worksheet there is an example comparing bubble sort and shuttle sort, an example finding the order of an algorithm and then some examples using the order of an algorithm to estimate the time it will take to solve a problem of a particular size (fully-worked solutions are provided). In the second worksheet there are 12 exam-style questions on using the order of an algorithm to estimate the time it will take to solve a problem of a particular size. There is also the excel spreadsheet I created to generate examples - this can used to make as many more examples as you want.

#### Resources to teach and practise first-fit algorithm (Decision maths D1 - OCR 4736)

After a few years of teaching packing algorithms by creating and working through examples on the board I got sick of it and created these resources. They make it easy to introduce, work through some examples and then there is another worksheet full of examples for students to attempt where the fully-worked solutions are already done, making it easy to check. The printable worksheets mean that students don't need to copy down lists of numbers or create tables to work on - this means they can spend the time just practising using the algorithm. There is also the excel spreadsheet I created to generate examples - this can used to make as many more examples as you want (instructions are on the spreadsheet).

#### Resources to teach and practise shuttle sort (Decision maths D1 - OCR 4736)

After a few years of teaching sorting algorithms by creating and working through examples on the board I got sick of it and created these resources. They make it easy to introduce, work through some examples and then there is another worksheet full of examples for students to attempt where the fully-worked solutions are already done, making it easy to check. The printable worksheets mean that students don't need to copy down lists of numbers or create tables to work on - this means they can spend the time just practising using the algorithm. There is also the excel spreadsheet I created to generate examples - this can used to make as many more examples as you want (instructions are on the spreadsheet).

#### Resources to teach and practise using bubble sort (Decision maths D1 - OCR 4736)

After a few years of teaching sorting algorithms by creating and working through examples on the board I got sick of it and created these resources. They make it easy to introduce, work through some examples and then there is another worksheet full of examples for students to attempt where the fully-worked solutions are already done, making it easy to check. The printable worksheets mean that students don't need to copy down lists of numbers or create tables to work on - this means they can spend the time just practising using the algorithm. There is also the excel spreadsheet I created to generate examples - this can used to make as many more examples as you want (instructions are on the spreadsheet).

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

#### Cross-Curricular Election Maths: Voting Systems

Ideal for use in election years, particularly when things happen like Trump becoming president, despite not winning the popular vote. This is a differentiated lesson looking at the use of different voting systems, their advantages and disadvantages. In this lesson, students will: - Look at the mechanics of different voting systems including: First past the post, alternative voting, BORDA count, weighted BORDA count and a two-round system. - Try out the voting systems to see who would win in a hypothetical situation - Think about how they would vote tactically in each voting system to block someone from getting in - Consider the advantages/disadvantages of each. - Reflect on their learning To really 'show' that there is no perfect system, the votes have been designed so that using each voting system produces a different winner!

#### Decision Maths

Presentations that cover the majority of A level decision maths units

#### Decision 1 Chapter 1 Algorithms

SMART notebook file guiding through the whole chapter of Decision 1 Algorithms. Includes: General Algorithms, Bubble &amp; Quick Sorts, Binary Search, Bin Packing.

#### Computing and Maths

iCompute's contribution to the Hour of Code 2016. A cross curricular lesson and the resources needed to teach it for Key Stage 2 pupils.

#### Bin Packing Algorithms

Written for MEI, so no lower bound. Contains examples and a bit of material on the subject.

#### 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

#### D1 - Algorithms

Lesson plans for Chapter 2 and workbook for whole D1 module with answers.

#### Decision Maths- Flowcharts

Introduction to D1 and starting Flowcharts, plus the workbook for the D1 module.

#### Minimum Connectors (Prim's and Kruskal's algorithms)

A sorting task suitable for students studying Decision 1. Cut out the networks and statements and sort them into a large copy of the table (I used magic whiteboard sheets on the desk). Ensure students can justify their solutions - get them to swap partners and explain their choices. Multiple solutions are possible!

#### Decision 1 - Chapter 3 - Algorithms on Networks

Everything required to teach chapter 3. Detailed enough to teach(refresh!) the teacher too.

#### Mathematics Decision 1 Lessons

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.

#### Mathematics Decision 1 Lessons

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.

#### A Level EdExcel Decision Mathematics 1 - Notes and Worked Examples

This is a powerpoint covering all areas of Decision 1 (I realise they are only putting it in further maths from 2017). It contains brief notes by way of an explanation, model answers to questions and a question or two for the students to do; all of the questions come with answers that you can display when ready. The slide show comes with a progress grid (regularly referred to in the presentation) so that students can mark their progress from start to finish and pinpoint any areas that may need extra work with a “red/amber/green” system that they fill in. It’s what I use in my lessons before setting tasks from worksheets or text books to practice.

#### Flow augmentation algorithm

A large presentation that shows the learners how to complete the flow algorithm. It includes flows, cuts, maximum and minimum flows and also restricted vertices. Also is 2 examples of minimax and maximin problems 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.

#### Hungarian Algorithm for allocation

Presentation that shows learners how to preform the Hungarian algorithm. It covers the full algorithm and also looks at max/min problems and dummy rows. 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.