Edexcel A-Level Mathematics AS D1.2.2 Dijkstras Algorithm for Finding the Shortest Path Topic Practice

EduNinja

Pearson Edexcel IAL Mathematics

Unit P1: Pure Mathematics 1

P1.1 - Algebra and functions

P1.2 - Coordinate geometry in the (x, y) plane

P1.3 - Trigonometry

P1.4 - Differentiation

P1.5 - Integration

Unit P2: Pure Mathematics 2

P2.2 - Algebra and functions

P2.3 - Coordinate geometry in the (x, y) plane

P2.4 - Sequences and series

P2.5 - Exponentials and logarithms

P2.6 - Trigonometry

P2.7 - Differentiation

P2.8 - Integration

Unit FP1: Further Pure Mathematics 1

FP1.1 - Complex numbers

FP1.2 - Roots of quadratic equations

FP1.3 - Numerical solution of equations

FP1.4 - Coordinate systems

FP1.5 - Matrix algebra

FP1.6 - Transformations using matrices

Unit M1: Mechanics 1

M1.1 - Mathematical models in mechanics

M1.2 - Vectors in mechanics

M1.3 - Kinematics of a particle moving in a straight line

M1.4 - Dynamics of a particle moving in a straight line or plane

M1.5 - Statics of a particle

Unit S1: Statistics 1

S1.1 - Mathematical models in probability and statistics

S1.2 - Representation and summary of data

S1.3 - Probability

S1.4 - Correlation and regression

S1.5 - Discrete random variables

S1.6 - The Normal distribution

Unit D1: Decision Mathematics 1

D1.1 - Algorithms

D1.2 - Algorithms on graphs

D1.2.1 - Minimum spanning tree

D1.2.2 - Dijkstra’s algorithm for finding the shortest path

D1.3 - Algorithms on graphs II

D1.4 - Critical path analysis

D1.5 - Linear programming

Could not load this view

HTTP 429