Maths — Decision 1

Maths YMA01 — specification explorer

All 15 specification statements from the official Pearson Edexcel specification, as printed — filter by paper, unit or tier exactly as Pearson Edexcel assesses them.

Scope the specification

15 spec points

Unit

Every statement · D1

Assessment homes come from the parsed Pearson specification (content summaries & assessment overviews). Hover a chip for the printed rule. Filters appear only where the qualification has that structure — a linear IGCSE has no unit scope, and only Maths A splits Foundation / Higher tiers.

1. Algorithms

1.1The general ideas of algorithms and the implementation of an algorithm given by a flow chart or text. The order of an algorithm is not expected. Whenever finding the middle item of any list, the method defined in the glossary must be used.D1
1.2Students should be familiar with bin packing, bubble sort, quick sort, binary search. When using the quick sort algorithm, the pivot should be chosen as the middle item of the list.D1

2. Algorithms on graphs

1. Algorithms on graphs

2.1
The minimum spanning tree (minimum connector) problem. Prim’s and Kruskal’s algorithm.:
- Matrix representation for Prim’s algorithm is expected. Drawing a network from a given matrix and writing down the matrix associated with a network will be involved.
D1
2.2Dijkstra’s algorithm for finding the shortest path.D1

3. Algorithms on graphs II

1. Algorithms on graphs II

3.1Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex. The network will have up to four odd nodes. Also known as the ‘Chinese postman’ problem. Students will be expected to use inspection to consider all possible pairings of odd nodes. (The application of Floyd’s algorithm to the odd nodes is not required.)D1
3.2The practical and classical Travelling Salesman problems. The classical problem for complete graphs satisfying the triangle inequality. The use of short cuts to improve upper bound is included.D1
3.3Determination of upper and lower bounds using minimum spanning tree methods. The conversion of a network into a complete network of shortest ‘distances’ is included.D1
3.4The nearest neighbour algorithm.D1

4. Critical path analysis

1. Critical path analysis

4.1Modelling of a project by an activity network, from a precedence table. Activity on arc will be used. The use of dummies is included. In a precedence network, precedence tables will only show immediate predecessors.D1
4.2Completion of the precedence table for a given activity network.D1
4.3Algorithm for finding the critical path. Earliest and latest event times. Earliest and latest start and finish times for activities.D1
4.4Total float. Gantt (cascade) charts. Scheduling.D1

5. Linear programming

1. Linear programming

5.1Formulation of problems as linear programs.D1
5.2Graphical solution of two variable problems using ruler and vertex methods.D1
5.3Consideration of problems where solutions must have integer values.D1