Monday, 19 March 2012

Decision 1 worked solutions

Jan 2011

May 2010

Jan 2010

May 2009

Jan 2009

Mock paper

Practice paper A

Practice paper B


Core 4 worked solutions

Jan 2011

June 2010

Jan 2010

June 2009

Jan 2009

June 2008

Jan 2008

June 2007

Jan 2007

June 2006

Jan 2006

June 2005

Core 3 worked solutions

Jan 2011

June 2010

Jan 2010

June 2009

Jan 2009

June 2008

Jan 2008

June 2007

Jan 2007

June 2006

Jan 2006

June 2005




Tuesday, 1 November 2011

D1 Critical path analysis 01/11/11

  • Precedence/dependence tables
  • Drawing network from precedence table
  • Early and late event times
  • Slack on events
  • Float on activities
  • Critical activities
  • Critical path
  • Cascade (Gannt) chart

Tuesday, 18 October 2011

D1 Matchings 18/10/11

  • Reminder of bipartite graphs
  • Matchings - trivial, maximal, complete
  • Alternating paths to improve matchings
  • Exam questions involving matchings

Tuesday, 4 October 2011

D1 Route inspection 04/10/11

  • Reminder of traversable (Eulerian) and semi-traversable (semi-Eulerian) graphs
  • The route inspection problem
  • Examples of using the route inspection problem