Read your relevant specification here to know what you have to learn. We currently have the following maths notes on A-Level Maths Decision 1 (D1). (These notes are in alphabetical order to make it easier to find the specific one)

- Adjacency Matrices
- An Algorithm for Determining Whether or Not a Graph is Planar
- Bin Packing Algorithms – First Fit Algorithm
- Binary Search Algorithm
- Complete Graphs
- Constraints in Linear Programming
- Critical Path Analysis – A Brief Explanation
- Dijkstra’s Algorithm
- Dummies
- Earliest and Latest Times
- Eulerian From Non – Eulerian Graphs
- Eulerian Graphs
- Finding Conditions on Distances With Djikstra’s Algorithm
- Finding the Number of Paths for a Complete Graph
- First Fit Decreasing Algorithm
- Float
- Flow Charts
- Graphs
- Introduction to Monte Carlo Methods
- Kruskal’s Algorithm
- Kruskal’s Algorithm in Table Form
- Linear Programming
- Matchings
- Prim’s Algorithm – Finding the Minimum Spanning Tree
- Prim’s Algorithm in Table Form
- Rules for Drawing Activity Networks
- Terminology
- The Bubble Sort Algorithm
- The Full Bin Packing Algorithm
- The Order of an Algorithm
- The Quick Sort Algorithm
- The Russian Peasant Algorithm
- The Shell Sort Algorithm
- The Shuttle Sort Algorithm
- Trace Tables
- Vertex Testing

If you believe that there are any mistakes with the notes or that there are notes missing, then please contact us here. We advise you to use the search bar for our website on the right to find any notes that you think are missing from this section as those particular notes might be somewhere else on this website. These notes are for all A-Level specifications but we have found it difficult to accommodate each specification for each module so contact us if you have a solution or if there are notes missing for a specification that you think should be here. We are trying to make this a maths website for all. Any help or feedback will be appreciated.