| Autumn 1 (Sept – Oct) | Autumn 2 (Nov – Dec) | Spring 1 (Jan – Feb) | Spring 2 (Mar – Apr) | Summer (May – Jun) | |
|---|---|---|---|---|---|
| Topic Title | Units 1-2-3: | Units 4-5: | Unit 6: | Unit 7: | Revision |
| Algorithms, Graphs and Networks, Algorithms on graphs | Route Inspection, Travelling Salesman problem | Critical path analysis | Linear programming | ||
| Key Skills and Content | • Flow Chart | • Eulerian graphs | • Modelling a project | • Formulate a linear programming problem | • Revision and exam practice |
| • Sorting, searching and packing algorithms | • Using the route inspection algorithm | • Dummy activities | • Graphical methods | ||
| • Graph Theory | • Classical and practical travelling Salesman problems | • Early and late event times | • Locating the optimal solution | ||
| • Application of Kruskal’s, Prim’s and Nearest neighbour’s algorithm | • Using MST and Nearest neighbour algorithm to find bounds | • Calculate the total float of an activity | • Determine solutions that need integer values | ||
| • Dijkstra Algorithm | • Identify critical activities | ||||
| • Gantt charts | |||||
| • Construct scheduling diagrams | |||||
| Summative Assessment | Practice exams taken from past exam papers | Practice exams taken from past exam papers | Practice exams taken from past exam papers | Practice exams taken from past exam papers | Practice exams taken from past exam papers |
