D1

Video resources

  1. Chapter 2: Graphs and networks
    1. Graph theory: terminology and introduction (exam questions)
    2. Writing graphs as matrices
  2. Chapter 3: Algorithms on networks
    1. Kruskal’s algorithm for finding minimum-spanning trees
    2. Prim’s algorithms for finding minimum-spanning trees, for both networks and matrices
    3. Dijkstra’s algorithm for finding the shortest path between two points
  3. Chapter 3: Route inspection
    1. Determining whether a graph is traversable, and using the route inspection algorithm to find the shortest route in a network
  4. Chapter 4: Critical path analysis
    1. Drawing activity networks, given a precedence table
    2. Forward and backwards passes with early and late event times (more)
    3. Critical activities, Gantt charts and Scheduling diagrams
  5. Chapter 6: Linear programming
    1. Formulating a problem as a linear programming problem (example)
    2. Illustrating a two-variable linear programming problem graphically (exam question 1, exam question 2)
    3. The ruler method to find the optimal point in a feasible region
    4. The vertex-testing method to find the optimal point in a feasible region (example)
    5. Determining solutions that need integer values
  6. Chapter 7: Matchings
    1. Bipartite graphs (exam questions)
    2. Maximum matching algorithm
  7. Chapter 1: Algorithms
    1. Trace tables and flow charts
    2. Bubble sort (exam questions)
    3. Quick sort (exam questions)
    4. Binary search [note: the first example in this video is wrong: he hasn’t sorted it first which is essential. Go straight to the second example]
    5. Bin-packing algorithms (exam questions)

Irrelevant past paper questions

Some of the past paper questions are no longer relevant to the exam you will sit this year due to changes of syllabus. Here is a list of all questions you can happily discard.

June 2014 None
June 2013 None
January 2013 None
May 2012 None
January 2012 None
June 2011 None
January 2011 None
May 2010 None
January 2010 None
May 2009 None
January 2009 None
May 2008 5, 6
January 2008 6
November 2007 Practice A None
November 2007 Practice B None
June 2007 7, 8
January 2007 3bc, 4, 8
May 2006 6, 7
January 2006 4
June 2005 2, 7, 8
January 2005 6, 7bcd
November 2004 1, 2
June 2004 5
January 2004 2, 3
November 2003 2b, 7, 8bcdef
June 2003 7
January 2003 1, 7, 8
November 2002 1, 7, 8bc
May 2002 2, 7
January 2002 6
June 2001 6, 7
January 2001 6, 7bce
2000 Mock paper 3, 4
2000 Specimen 4, 6