D1

Course Companion

Name:

Tutor:
p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

Introduction
Revision for D1 splits into two main sections:
1. Learning definitions and algorithms
2. Rehearsing the skill of applying those algorithms to answer exam questions.
This booklet addresses only part 1: learning.
Once you have learnt these definitions and algorithms you must practise using them to solve
questions from past exam papers.
You would be wise to try a minimum of five or six past papers. You must then mark them carefully
and identify and correct your errors. After identifying your weak topics you must then set about relearning, revising and rehearsing the skills you need to get this kind of question right next time. Aim
to eliminate at least 20% of the missed marks at each successive attempt.
This process is likely to take about 4 to 6 hours per paper, so you should set aside around thirty
hours of revision to the exam-practice phase.
How long it takes you to memorise the contents of this booklet depends on your prior knowledge,
aptitude for memorisation and learning habits. Since we cant affect the first two, all we can do is
ensure you approach memorising these definitions and algorithms as efficiently as possible. You
need to find the time to do this memorisation though, as more than for any other A-level module, in
D1 you cannot hope to succeed without remembering a lot of detailed definitions and algorithms.
If you are unclear about efficient strategies for memorising facts, definitions and the like, please
ask. There is much good advice available, but a few quick questions should allow you to test your
revision habits for memory efficiency:
Do you have a clear list of exactly what you need to learn? (Yes its this booklet)
Do you have a schedule or plan to get through it all?
Are you being an active participant in the revision, or are you just reading it?
Are you transforming the information, say from a list to a diagram or from text to a list?
Have you planned for repetition, so that you see difficult to remember facts at intervals of
say 1hour, 1 day, 1 week and then 1 month apart?
Have you got strategies for checking what you have learnt and what is not yet secure?
Have you considered the possibility of working with others to teach or test them?
Can you be creative or competitive in making memorisation fun or making it a game?
Many years ago my A-level Chemistry teacher wrote on my school report that I would do better in
Chemistry if I vised before I revised. In the spirit of this, we may wish to start with the question:
are we ready to revise? As a result this booklet begins with a checklist to help you ensure that
youve completed all you need to of the exercises in the textbook before you begin your revision.
If time is short or your grasp of skills and concepts is secure, you and your teacher may decide that
it is unnecessary to complete every question in every exercise. Thats fine, just record the bits you
have done with a tick and that other parts have been intentionally skipped with a cross .
Leaving the checkbox blank for parts that you know you need to complete will help you prioritise
getting done what is necessary for your success. Its up to you whether you get down to questionlevel detail and whether you choose to record dates or comments.

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

Exercise Checklist
Exercise

Topics and notes

Date set

Complete?

Basic algorithms in words

Ex 1A

Q1
Q2
Q3
Q4

Notes:

Flow charts

Ex 1B

Q1
Q2
Q3
Q4

Notes:

Sorting algorithms

Ex 1C

Q1
Q2
Q3
Q4
Q5

Notes:

Binary search algorithm

Ex 1D

Q1
Q2
Q3
Q4
Q5

Notes:

Bin-packing algorithms

Ex 1E

Q1
Q2
Q3
Q4
Q5

Notes:

Miscellaneous exam questions on simple algorithms

Ex 1F

Q1
Q2
Q3
Q4
Q5
Q6
Q7

Notes:

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

Exercise

Topics and notes

Date set

Complete?

Introduction to graphs and key vocabulary of graphs

Ex 2A

Ex 2B

Q1
Notes:
Q2
Q3
Q4
Q5
Q6
Q7
Q8
Trees, complete graphs, isomorphic graphs and adjacency
matrices
Q1
Notes:
Q2
Q3
Q4
Q5
Q6
Q7
Q8
Q9
Q10

Miscellaneous questions about graphs and definitions

Ex 2C

Q1
Q2
Q3
Q4
Q5
Q6

Notes:

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

Exercise

Topics and notes

Date set

Complete?

Minimum spanning tree using Kruskals algorithm

Ex 3A

Q1
Q2
Q3
Q4

Notes:

Minimum spanning tree using Prims algorithm

Ex 3B

Q1
Q2
Q3
Q4

Notes:

Minimum spanning tree using Prims Matrix algorithm

Ex 3C

Q1
Q2
Q3
Q4
Q5

Notes:

Shortest path using Dijkstras algorithm

Ex 3D

Q1
Q2
Q3
Q4
Q5
Q6

Notes:

Miscellaneous exam questions on MST and shortest path

Ex 3E

Q1
Q2
Q3
Q4
Q5
Q6
Q7
Q8

Notes:

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

Exercise

Topics and notes

Date set

Complete?

Eulerian, semi-Eulerian, traversable

Ex 4A

Q1
Q2
Q3
Q4
Q5
Q6
Q7

Notes:

Route inspection problem, Chinese Postman

Ex 4B

Q1
Q2
Q3
Q4

Notes:

Miscellaneous exam questions on route inspection

Ex 4C

Q1
Q2
Q3
Q4
Q5
Q6

Notes:

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

Exercise

Topics and notes

Date set

Complete?

Precedence tables, activity networks

Ex 5A

Q1
Q2
Q3
Q4

Notes:

Activity networks using dummy activities

Ex 5B

Ex 5C

Q1
Notes:
Q2
Q3
Q4
Q5
Early event time, late event time, forward scan, backward
scan
Q1
Notes:
Q2
Q3
Critical path, critical activities

Ex 5D
Ex 5E
Ex 5F
Ex 5G

Q1
Q2
Q3

Notes:

Float and total float

Q1
Q2

Notes:

Cascade charts, Gantt charts

Notes:
Q1
Q2
Using Gantt charts what activities must or may be
happening?
Q1
Notes:
Q2
Q3
Scheduling, lower bound for workers required

Ex 5H

Ex 5I

Q1
Notes:
Q2
Q3
Miscellaneous exam questions on critical path, cascade
charts and scheduling
Q1
Notes:
Q2
Q3
Q4
Q5

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

Exercise

Topics and notes

Date set

Complete?

Formulating linear programming problems

Ex 6A

Ex 6B

Ex 6C

Ex 6D

Ex 6E

Q1
Notes:
Q2
Q3
Q4
Q5
Q6
Q7
Illustrating two-variable linear programming problems
graphically; feasible regions
Q1
Notes:
Q2
Q3
Q4
Q5
Q6
Finding the optimal point in a feasible region using the
objective line (ruler) method and vertex testing method
Q1
Notes:
Q2
Q3
Q4
Q5
Q6
Q7
Q8
Q9
Solving linear programming problems requiring integer
solutions
Q1
Notes:
Q2
Q3
Q4
Q5
Q6
Q7
Q8
Miscellaneous examination questions on linear
programming
Q1
Notes:
Q2
Q3
Q4
Q5

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

Exercise

Topics and notes

Representing matching problems using bipartite graphs

Ex 7A

Ex 7B

Q1
Notes:
Q2
Q3
Maximum matching algorithm including examination
questions
Q1
Notes:
Q2
Q3
Q4
Q5
Q6
Q7
Q8

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

Date set

Complete?

It is quite likely that you will have omitted all or part of the review exercises on working your way
through the book. Thats ok. You may wish to memorise the definitions and algorithms below and
return to these, but do these you must, for they contain a rich seam of exam practice to which you
have answers and worked animated solutions on the CD-ROM.
Exercise

Topics and notes

Date set

Complete?

Miscellaneous exam question review 1

Rev 1

Q1
Q2
Q3
Q4
Q5
Q6
Q7
Q8
Q9
Q10
Q11
Q12
Q13
Q14
Q15
Q16
Q17
Q18
Q19
Q20
Q21
Q22
Q23
Q24
Q25
Q26
Q27
Q28
Q29
Q30
Q31

Notes:

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

10

Exercise

Topics and notes

Date set

Complete?

Miscellaneous exam question review 2

Rev 2

Q1
Q2
Q3
Q4
Q5
Q6
Q7
Q8
Q9
Q10
Q11
Q12
Q13
Q14
Q15
Q16
Q17
Q18
Q19
Q20
Q21
Q22
Q23
Q24
Q25
Q26

Notes:

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

11

Past paper checklist.

paper

done?

marked?

Sample Paper

January 2009

May/June 2009

January 2010

May/June 2010

January 2011

May/June 2011

January 2012

score/grade

75

75

75

75

75

75

75

75

re-sit of

_____________

75

notes (what went well.../even better if...)

www:

ebi:

www:

ebi:

www:

ebi:

www:

ebi:

www:

ebi:

www:

ebi:

www:

ebi:

www:

ebi:

www:

ebi:

You may wish to try additional papers from 2001 through to 2008, but there was a change to the D1
Specification in 2008 and certain topics were dropped. Be careful in selecting questions from
earlier years. The 2009 Specification can be found at:
http://www.edexcel.com/migrationdocuments/GCE%20New%20GCE/UA024850%20GCE%20in
%20Mathematics%20issue%202%20180510.pdf

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

12

D1
Revision Guide

Name:

Tutor:

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

13

Definitions
The following is a list of almost every bold keyword in the current D1 text (Jameson, 2009), given in
the order they appear. Page references are given [p1] for example. Named algorithms you must
learn are numbered like this: (A1) and given in the next section.
Algorithm: a precise set of instructions so clear that it will allow anyone, even a computer, to use it
to achieve a particular goal in a specified number of steps. [p1]
Flow chart: a visual representation of an algorithm in which boxes and lines are used to indicate
different steps in a process. [p5]
start/end

instruction

decision

flow to next step

Bubble sort: an algorithm (A1) to sort a list into alphabetical or numerical order. [p10]
Adjacent: next to each other. [p10]
Pass: one run through a set of steps in an algorithm which may be repeated. [p10, but not bold]
Quick Sort: an algorithm (A2) to sort a list into alphabetical or numerical order. [p12]
Pivot: the item selected in the quick sort algorithm against which you compare values and sort into
sub-lists. [p12]
Sub-list: a list of those items in quick sort which are either less than or more than a particular pivot
value. Each sub-list remains in the order of the items before comparison with the pivot. [p12]
Binary Search: an algorithm (A3) to check whether a particular value appears in an ordered
numerical or alphabetical list. [p14]
Ordered list: a list that has been sorted, perhaps by the quick sort or bubble sort algorithm. [p14]
Bin-Packing Problem: a class of problems in which it is desirable to fit items of varying small sizes
into containers of a larger size, called bins. The sizes may typically refer to lengths or times. [p17]
Optimal Solution: the best possible answer to a problem. A sub-optimal solution is one which is
not optimal. [p18, but not bold]
First-Fit Algorithm: a quick, but often sub-optimal, bin-packing algorithm (A4) in which unsorted
items are placed in the first bin possible. [p18]
First-Fit Decreasing Algorithm: an easy, two-step bin-packing algorithm (A5) that gives fairly
good, but possibly sub-optimal solutions by sorting the items first, them applying the first-fit
algorithm. [p19]
Full-Bin Packing: a bin-packing routine (A6) which relies on too much intelligent judgement to be
properly called an algorithm: the user spots combinations of items that fit together to fill bins and
p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

14

then places remaining items by using the first-fit algorithm. It is slow, particularly with large sets of
data and hard to program, but often results in an optimal solution. [p19]
Graph: an object consisting of points which are connected by lines. [p26]
Vertex: a point on a graph. Plural: vertices. [p26]
Node: another name for a vertex or a point on a graph. [p26]
Edge: a line connecting a pair of points on a graph; these points may be a single point see loop
below. [p26]
Arc: another name for an edge. [p26]
Weight (of an edge): a number associated with an edge (arc) that represents length, cost, time or
some other variable associated with this line. [p26]
Weighted graph: a graph in which all edges have a weight. [p26]
Network: a shorter name for a weighted graph. [p26]
Vertex set: the set of all nodes or vertices of a graph [p28]
Edge set: the set of all arcs or edges of a graph [p28]
Subgraph: starting from an original graph G, select some or all of the vertices and some of the
edges. A subgraph is simply part of the original graph. [p29]
Degree (of a vertex): is the number of edges incident to it. That is to say, the degree of a node is
the number of arcs coming from it. [p29]
Valency (of a vertex): another name for the degree of a vertex. [p29]
Order (of a vertex): yet another name for the degree of a vertex. [p29]
Handshaking lemma: the sum of the degrees of all vertices in a graph must be even since we count
each edge twice once from each end of the handshake between its vertices. [p29 but not bold]
Even degree: a vertex which has a degree which is an even number. [p29]
Odd degree: a vertex which has a degree which is an odd number. [p29]
Walk: a finite sequence of edges, such that the end vertex of one edge is the start of the next edge.
[p29]
Path: a finite sequence of edges, such that the end vertex of one edge is the start of the next edge
and in which no vertex appears more than once. A path is a special case of a walk in which no vertex
is revisited. [p29]
Cycle: is a path which is then closed by the addition of an extra edge which joins the paths ending
vertex back to the paths starting vertex.
p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

15

Circuit: another name for a cycle. [p29]

Connected: (a property of a vertex) two vertices are connected if there is a path between them.
[p30]
Connected: (a property of a graph) a graph is connected if all possible pairs of vertices in it are
connected. [p30]
Loop: an edge that starts and finishes at the same vertex. [p30]
Simple graph: a graph in which there are no loops and no pair of vertices has more than one edge
joining them directly. [p30]
Directed edge: an edge in which the direction of connection matters and is shown by an arrow.
[p30]
Directed graph: a graph that contains directed edges. [p30]
Digraph: a directed graph. [p30]
Tree: a connected graph that contains no cycles. [p32]
Spanning tree: (of a graph G) is a subgraph of G which includes all the vertices but only sufficient
of the edges to be a tree. [p32]
Bipartite graph: a graph which contains two sets of vertices, say X and Y, in which all the edges
join a vertex in set X to a vertex in set Y. [p33]

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

16

p.a.capewell for EPCHS and mathsurgery.wikispaces.com March/April 2012

17