Friday 30th Sep – Eulerian Trails and the Route Inspection Problem

LEARNING OBJECTIVE: To discover what the following terms mean –Eulerian, semi Eulerian and Traversable and solve problems like the 'The Chinese Postman Problem"

SUCCESS CRITERIA: You will be able to solve Chinese Postman Type Problems

LESSON: Discover what is meant by Traversable, Eulerian and Semi-Eulerian Using this Lesson

Exercise 4A

 

Chinese Postman Problem – Work thorugh this lesson, then this lesson

 

Exercise 4B to Complete

 

PLENARY: Checking answers to questions in class

Tues 27th Sep – Exam Revision – Indices and Standard Index Form

LEARNING OBJECTIVE: TO revise Indices Laws and Standard Index Form
SUCCESS CRITERIA: You will be able to answer indices and Standard Index form Exam questions

Practice Paper – unit 2 Higher - Set 1

STARTER:

Answer at least three of these algebra questions:

Expand and simplify the following

6 – 4(3X – 5)	(3X + 3)(5X – 4)	3(

Fri 23rd Sep – Dijkstra’s Algorithm

LEARNING OBVJECTIVE: TO Assimilate the steps in Dijkstra's algorithm and apply them to solve real life problems

SUCCESS CRITERIA: You will be able to use Dijkstra's algorithm to find solutions to 'Shortest Path' problems on Distance Network.

LESSON 1: Work through the first three screens of this Lesson. Use the printouts of screens 4, 5 6 and 7 to give students an opportunity to try applying the algorithm themselves step by step, using the onscreen verision as checks to their progress.

Use screen 8 to Summarise the first stages of using Dijkstr'a Algorithm

PLENARIES: Checking their progress with onscreen working of the problems set.

LESSON: 2

Work through the second stages of Dijkstra's algorithm, so we can find the route of the shortest path.

PLENARIES: Checking their progress with onscreen working of the problems set.

HOMEWORK: Ex 3b, 3c and 3d = Revision on First three chapters for test next Weds

Weds 21st Sep – Prim’s Algorithm and Dijkstra’s Algorithm

LEARNING OBJECTVIE: To apply Prims algorithm to find minimum spanning tree AND Dijkstra's algorithm for finding the shortest path between two vertices in a network.

SUCCES CRITERIA: You Will be able to apply both algorithms to networks to solve problems.

LESSON: PRIMS Algorithm 1, Prims Algorthim 2

Exercise 3B and 3C to be completed for Homework

PLENARY: Check on understanding of both ways of applying Prims Algorithm

Weds Sep 13th – Graphs and Networks

LEARNING OBJECTIVE: Understand Graph and network terminology, model a situation using a graph, understand how to represent a graph using a matrix. Be able to use Kruskals algorithm to find a minimum spanning tree.

SUCCES CRITERIA: You Should:

1. Know how networks and graphs can be used to create mathematical models
   
2. Know some basic knowledge of graph theory terminology
   
3. Know some special types of graphs
   
4. Understand how graphs and networks can be represented by matrices.
   
5. Understand what a minimum spanning tree is and use Kruskals algorithm to find one.
   

LESSON: Quickly take students through pages 26 to 35 of text book. Then in Friday's lesson and homework do Ex 2a and 2b.

If you need more explanations work through these MyMaths Lessons at Home

Intro to Graphs, Types of Graph
Defining Graphs, Modelling with Graphs

MyMthas Lesson on Kruskals Algorithm

Homework Ex 3A - using Kruskals Algorithm

Tues Sep 13th Data Collection methods

LEARNING OBJECTIVE: You are going to look at good questionnaire design

SUCCESS CRITERIA: You will understand how to avoid biased, embarrassing and leading questions when designing a questionnaire

STARTER: Arrange the numbers

LESSON: Work through the first two screens of this Mymaths Lesson

Now Try and work through these questions

PLENARY: Discussion on answers to questions and correct answers

Friday 9th Sep – Quick Sort Middle Item Algorithm, Binary Search and Bin Packing Algorithms

LEARNING OBJECTIVE: to discover and practice the following algorithms: Quick Sort Middle item, Binary Search, Bin Packing - First Fit, First Fit Decreasing and Full Bin

Success criteria: You will be able to apply all the algorithms efficiently .

Quick Sort middle Item

Binary Search

Bi Packing – First Fit, Bin Packing Full Bin

Bin Packing First Fit Decreasing

Homework Ex A,B,C D,E from Chapter 1

Hanson (and Sam?) Work through Q1 to 7 pages 77 and 78 of old D1 text Book

Weds Sep 7th – Check on Chapter 1 of D1

Learning
Objective: To ensure summer holiday preparation has been completed for Chapter 1 – Algorithms from module D1

SUCCESS
Criteria: You will be able to answer exam style questions on Sorting Algorithms, Bin Packing Algorithms and binary Search Algorithms

STARTER: Logon to Laptop, discuss Algorithms Chapter from D1 and AS results

LESSON: Complete all MyMaths homework tasks and / or Questions 1 to 7 from review exercises pages 77 – 79

If any Students NOT completed work over summer they have an opportunity in this weeks lessons to 'catch up'

PLENARY: Discussion on 'where students are' Plan of work for next two weeks to ensure both Chapter 1 and Chapter 2 are completed by September 23^rd.