This is a group of On Demand Professional Development (ODPD) pods designed to support teachers who will be offering the Discrete, Decision or Modelling with Algorithms content of AS or A level Further Mathematics.
The course will comprise a series of ‘pods’, forming the building blocks of each of the main specifications for this course component. When complete, this will provide teachers with professional development covering all common aspects of the Discrete, Decision or Modelling with Algorithms courses.
In each pod, teachers will experience a variety of content including:
- short videos explaining the ideas behind the topic
- practice materials
- triggers for reflection and suggestions for further study.
Teachers will be encouraged to interact and collaborate with others studying the same material via the online forums. An expert tutor will be monitoring the forums and will respond to queries.
The course offers total flexibility regarding when teachers can access the materials, day or night, over a period of up to one year. Teachers will be able to track their progress within the course and to see when they have completed a section or the full pod.
What are the aims of this professional development?
- To introduce teachers to a range of techniques which will enable them to work more confidently with topics in the Discrete, Decision or Modelling with Algorithms component of AS or A level Further Maths.
- To provide opportunities to reflect on methods, resources and teaching ideas and to discuss these with other teachers via the course forums.
Content
| Topic/Specification |
Approximate time to complete |
| Graph theory |
Up to 1 hour |
| Network algorithms |
Up to 4 hours |
| Critical path analysis |
Up to 1 hour |
| Linear programming |
Up to 1 hour |
| Simplex algorithm (A level only) |
Up to 1 hour |
| Network flow |
Up to 1 hour |
| Game theory |
Up to 2 hours |
| Binary operations |
Up to 1 hour |
| Group theory (A level only) |
Up to 1.5 hours |
| Topic/Specification |
Approximate time to complete |
| Algorithms |
Up to 4 hours |
| Graph theory (AS only) |
Up to 1 hour |
| Network algorithms (AS only) |
Up to 6 hours |
| Critical path analysis (AS only) |
Up to 1 hour |
| Linear programming (AS only) |
Up to 1 hour |
| Simplex algorithm (D1, A level only) |
Up to 1 hour |
| Further simplex algorithm (D1, A level only) |
Up to 0.5 hours |
| Transportation (D2, A level only) |
Up to 1 hour |
| Allocation (D2 only) |
Up to 1 hour |
| Network flow (D2 only) |
Up to 1 hour |
| Game theory (D2 only) |
Up to 2 hours |
| Recurrence relations (D2 only) |
Up to 1 hour |
| Further recurrence relations (D2, A level only) |
Up to 0.5 hours |
| Decision analysis (D2, A level only) |
Up to 1 hour |
| Dynamic programming (D2, A level only) |
Up to 1 hour |
| Topic/Specification |
Approximate time to complete |
| Algorithms |
Up to 4 hours |
| Network algorithms |
Up to 3 hours |
| Critical path analysis |
Up to 1 hour |
| Linear programming |
Up to 1 hour |
| Further linear programming |
Up to 0.5 hours |
| Simplex algorithm |
Up to 1 hour |
| Further simplex algorithm |
Up to 0.5 hours |
| Transportation |
Up to 1 hour |
| Network flow |
Up to 1 hour |
| Topic/Specification |
Approximate time to complete |
| Mathematical preliminaries |
Up to 1 hour |
| Further mathematical preliminaries (A level only) |
Up to 1 hour |
| Algorithms |
Up to 4 hours |
| Graph theory |
Up to 1 hour |
| Further graph theory (A level only) |
Up to 1 hour |
| Network algorithms |
Up to 5 hours |
| Critical path analysis |
Up to 1 hour |
| Linear programming |
Up to 1 hour |
| Further linear programming (A level only) |
Up to 0.5 hours |
| Simplex algorithm (A level only) |
Up to 1 hour |
| Game theory |
Up to 2 hours |
Timings are approximate and suggest the required time for a topic to be counted on a certificate of participation. Further resources are linked from each section and so participants may, if they wish, spend more time than this in consolidating and reflecting on the content. You do not need to complete all sections to request a certificate.
What will I need?
Internet connection with capability to watch video. You may find access to graphing software such as GeoGebra or Desmos is also useful.
Queries?
If you have any queries about this event, please do not hesitate to contact:
Teacher Support Admin Team
[email protected]
01225 776776
