Edexcel International A Level

Mathematics

Decision Making D1

About This Unit

When studying pure mathematics at AS and A2 level you will be extending your knowledge of such topics as algebra and trigonometry as well as learning some brand new ideas such as calculus. While many of the ideas you will meet in pure mathematics are interesting in their own right, they also serve as an important foundation for other branches of mathematics, especially mechanics and statistics.

Unit Content

  1. Chapter 1 Algorithms (D1) In this session, you will learn about Algorithms, one of the 6 topics you need to be knowledgeable in to master the Unit D1 paper in Mathematics. After completing this session, you will be able to use and understand an algorithm given in words, understand how flow charts can be used to describe algorithms, carry out a bubble sort, quick sort, and binary sort, as well as carry out the three bin packing algorithms and understand their strengths and weaknesses.
    0 Concepts, 0 Quizzes COMING SOON >
  2. Chapter 2 Algorithms of Graphs (D1) In this session, you will learn about Algorithms of Graphs, one of the 6 topics you need to be knowledgeable in to master the Unit D1 paper in Mathematics. After completing this session, you will be able to use Kruskal’s algorithm to find a minimum spanning tree, use Prim’s algorithm on a network to find a minimum spanning tree, apply Prim’s algorithm to a distance matrix, as well as use Dijkstra’s algorithm to find the shortest path between two vertices in a network.
    0 Concepts, 0 Quizzes COMING SOON >
  3. Chapter 3 The Route Inspection Problem (D1) In this session, you will learn about The Route Inspection Problem, one of the 6 topics you need to be knowledgeable in to master the Unit D1 paper in Mathematics. After completing this session, you will be able to determine whether a graph is traversable and use the route inspection (Chinese postman) algorithm to find the shortest inspection cycle in a network.
    0 Concepts, 0 Quizzes COMING SOON >
  4. Chapter 4 Critical Path Analysis (D1) In this session, you will learn about Critical Path Analysis, one of the 6 topics you need to be knowledgeable in to master the Unit D1 paper in Mathematics. After completing this session, you will be able to model a project by an activity network from a precedence table, understand the use of dummies, carry out a forward pass and a backward pass using early and late event times, identify critical activities, determine the total float of activities, construct cascade (Gantt) charts, use cascade (Gantt) charts, construct a scheduling diagram.
    0 Concepts, 0 Quizzes COMING SOON >
  5. Chapter 5 Linear Programming (D1) In this session, you will learn about Linear Programming, one of the 6 topics you need to be knowledgeable in to master the Unit D1 paper in Mathematics. After completing this session, you will be able to formulate a problem as a linear programming problem, illustrate a two-variable linear programming problem graphically, locate the optimal point in a feasible region using the objective line (ruler) method, as well as use the vertex testing method to locate the optimal point, determine solutions that need integer values.
    0 Concepts, 0 Quizzes COMING SOON >
  6. Chapter 6 Matchings (D1) In this session, you will learn about Matchings, one of the 6 topics you need to be knowledgeable in to master the Unit D1 paper in Mathematics. After completing this session, you will be able to model matching problems using a bipartite graph and use the maximum matching algorithm.
    0 Concepts, 0 Quizzes COMING SOON >

Unit Structure

Learn with the Best

Prerequisites and Requirements

Students who have achieved a grade of 'C' or higher in their IGCSE, GCSE, or any other equivalent 'O' Level Mathematics.

What's Next?

Core Mathematics
C12
Edexcel International A Level Mathematics

Related Courses