Monday, 28 November 2011

Tues 29th Nov – Revision of Exponential and Log Functions

LEARNING OBJECTIVE: To revise rules of logs to use when solving exponential and log functions as well as sketching exponential and log functions

SUCCESS CRITERIA: You will be able to solve C3 log and exponential questions

RULES OF LOGS

Work through this Logs/Exponential revision lesson

Work through Ex 3c page 41

Tuesday, 22 November 2011

Weds 23rd Nov – review of D1 Topics via mock exam paper

LEARNING OBJECTIVE: To refine exam technique by checking marks scheme against your own answers

SUCCESS CRITERIA: You gain higher marks in next mock exam paper

LESSON: Finish going through exam paper questions – Q 5, 6 & 7

If any time left students to choose their weakest topic and find an exam type questions from mixed exercises at the end of the appropriate chapter to have a go at.


 

Monday, 21 November 2011

Tues Nov 22nd – Review of Mock exam – Revision of Prims and Kruskals Algorithms

LEARNING OBJECTIVE: To develop deeper understanding of topics from results of mock exam Results

SUCCESS CRITERIA: You will understand where you lost marks in the recent exam paper test.

Give papers back

Look at results analysis. Work through Exam questions – explaining mistakes / errors. AT question 3 do some indepth revision of Prims and Kruskals Algorithms Using text book

Kruskals Definition on Page 41

Prims Definition on page 45

Have a go at 1, 2 and 6 on page 58, 59 and 60 of text book

Check answers

Tuesday, 15 November 2011

Weds 16th Nov – Consolidation of Matching – Corrections from Homework -

LEARNING OBJECTIVE: Review Matching homeworks – compare with requirements for Exam questions

SUCCESS CRITERIA: You will be aware of what to include in an A* Exam question on Matching's.

LESSON:

Review of Homework. Take note of the following

  1. Must include the alternate paths you have considered
  2. Must include new matching's
  3. Must include any intermediate positions in ,matching's (Eg if more than two pairs of unmatched)
  4. Must include the final complete matching or best matching plus a reason why complete matching not possible
  5. Use homework questions to demo above
  6. If any time left then start working through Examination Style paper on page 173 of text book (Photocopy masters provided for questions 1, 4, 5, 7, and 8

FRIDAY LESSON: Sit a past paper in exam conditions during the lesson

Wednesday, 9 November 2011

Friday Nov 11th (P1 & P2) – Work through a D1 Past Paper

LEARNING OBJECTIVE: Revise D1 Topics for January Exam

SUCCESS CRITERIA: You will be able to solve D1 exam Questions

LESSON: Hand out D1 Jan 2009 Exam Paper

Use Mark Scheme as and When Necessary

Whilst students are working meet with them individually to give current grades and set some targets in their planner

Tuesday, 8 November 2011

Weds Nov 9th – D1 Revision – Go Thorugh Test 2 / Exam questions

LEARNING
OBJECTIVE: TO Review Test 2 results – revising Critical Path Analysis, Rout Inspection Problem, & Linear Programming

SUCCESS
CRITERIA: You Will Be able to solve exam type questions on these topics

LESSON: Work through Test papers questions by question pointing out errors and how to ensure max marks in exam.

If Time Have a go at these questions:

Question 6 page 75

Question 5 page 111

Question 1 Page 145

Wednesday, 2 November 2011

Fri Nov 4th P2 & 3 – The Maximum Matching Algorithm and Test reviewing Chap 4, 5 & 6

LEARNING OBJECTIVE: Discover how to model a problem using a bipartite graph and solve problems using the maximum matching algorithm

SUCCESS CRITERIA: You will be able to solve matching problems using the maximum matching algorithm

LESSON:

Continue exploring matchin with This lesson on the maximum matching algorithm.

Homework Ex 7a and 7b using the templates provided

Period 3 Test on Chapters 4, 5 & 6

Tuesday, 1 November 2011

Weds Nov 2nd – Bipartite Graphs - Matchings

LEARNING OBJECTIVE: Discover how to model a problem using a bipartite graph and solve problems using the maximum matching algorithm

SUCCESS CRITERIA: You will be able to solve matching problems using the maximum matching algorithm

LESSON:

Quick reminder of What a Bipartite graph is using screens 3 & 4 of this Lesson. Use the examples to show how to find some possible matchings

You Should now be able to answer the three questions in Exercise 7a (Photocopy masters are available)

Explore finding matchings using this Lesson – using the example screens and problems with students.

If time allows continue with This lesson exploring the maximum matching algorithm

PLENARY: Checking understanding of students – preparation for Fridays lesson – Period 1 more on Matching with a chance to have a go at some questions. Period 2 – Test on Chapters 4 5 & 6