Decision Math 1 (Edexcel AS and A level Modular Math)

1. Algorithms

1.1 Understanding and using an algorithm given in words

1.2 Implementing an algorithm given in the form of a flow chart

1.3 Carrying out a bubble sort

1.4 Carrying out a quick sort

1.5 Implementing a binary search

1.6 Implementing the three bin packing algorithms and being aware of their limitations

2. Graphs and networks

2.1 Knowing how graphs and networks can be used to create mathematical models

2.2 Being familiar with some basic terminology used in graph theory

2.3 Knowing some special types of graph

2.4 Understanding how graphs and networks can be represented using matrices

3. Algorithms on networks

3.1 Using Kruskal’s algorithm to find a minimum spanning tree

3.2 Using Prim’s algorithm on a network to find a minimum spanning tree

3.3 Applying Prim’s algorithm to a distance matrix

3.4 Using Dijkstra’s algorithm to find the shortest path between two vertices in a network

4. Route inspection (Chinese postman problem)

4.1 Determining whether a graph is traversable

4.2 Using the route inspection algorithm to find the shortest route in a network

Review Exercise 1

5. Critical path analysis

5.1 Modelling a project by an activity network, from a precedence table

5.2 Understanding the use of dummies

5.3 Carrying out a forward pass and a backward pass using early and late event times

5.4 Identifying critical activities

5.5 Determining the total float of activities

5.6 Constructing cascade (Gantt) charts

5.7 Using cascade (Gantt) charts

5.8 Constructing a scheduling diagram

6. Linear programming

6.1 Formulating a problem as a linear programming problem

6.2 Illustrating a two-variable linear programming problem graphically

6.3 Locating the optimal point in a feasible region using the objective line (ruler) method

6.4 Using the vertex testing method to locate the optimal point

6.5 Determining solutions that need integer values

7. Matchings

7.1 Modelling matching problems using a bipartite graph

7.2 Using the maximum matching algorithm, starting from an initial matching

Review Exercise 2

Examination style paper

Answers

Index