Edexcel AS and A Level Modular Mathematics Decision Mathematics 1 D1
1st Edition
Published on 30. September 2016
240 pages
978-1-292-18507-1 (ISBN)
Description
Edexcel and A Level Modular Mathematics D1 features: Student-friendly worked examples and solutions, leading up to a wealth of practice questions. Sample exam papers for thorough exam preparation. Regular review sections consolidate learning. Opportunities for stretch and challenge presented throughout the course. Escalator section to step up from GCSE. PLUS Free LiveText CD-ROM, containing Solutionbank and Exam Caf to support, motivate and inspire students to reach their potential for exam success. Solutionbank contains fully worked solutions with hints and tips for every question in the Student Books. Exam Caf includes a revision planner and checklist as well as a fully worked examination-style paper with examiner commentary.
More details
Other editions
Additional editions
Book
05/2010
Edexcel Limited
€38.50
Shipment within 3-4 weeks
Content
- Cover
- Contents
- About this book
- Chapter 1: Algorithms
- 1.1: Understanding and using an algorithm given in words
- 1.2: Implementing an algorithm given in the form of a flow chart
- 1.3: Carrying out a bubble sort
- 1.4: Carrying out a quick sort
- 1.5: Implementing a binary search
- 1.6: Implementing the three bin packing algorithms and being aware of their limitations
- Summary of key points
- Chapter 2: Graphs and networks
- 2.1: Knowing how graphs and networks can be used to create mathematical models
- 2.2: Being familiar with some basic terminology used in graph theory
- 2.3: Knowing some special types of graph
- 2.4: Understanding how graphs and networks can be represented using matrices
- Summary of key points
- Chapter 3: Algorithms on networks
- 3.1: Using Kruskal's algorithm to find a minimum spanning tree
- 3.2: Using Prim's algorithm on a network to find a minimum spanning tree
- 3.3: Applying Prim's algorithm to a distance matrix
- 3.4: Using Dijkstra's algorithm to find the shortest path between two vertices in a network
- Summary of key points
- Chapter 4: Route inspection (Chinese postman problem)
- 4.1: Determining whether a graph is traversable
- 4.2: Using the route inspection algorithm to find the shortest route in a network
- Summary of key points
- Review Exercise 1
- Chapter 5: Critical path analysis
- 5.1: Modelling a project by an activity network, from a precedence table
- 5.2: Understanding the use of dummies
- 5.3: Carrying out a forward pass and a backward pass using early and late event times
- 5.4: Identifying critical activities
- 5.5: Determining the total float of activities
- 5.6: Constructing cascade (Gantt) charts
- 5.7: Using cascade (Gantt) charts
- 5.8: Constructing a scheduling diagram
- Summary of key points
- Chapter 6: Linear programming
- 6.1: Formulating a problem as a linear programming problem
- 6.2: Illustrating a two-variable linear programming problem graphically
- 6.3: Locating the optimal point in a feasible region using the objective line (ruler) method
- 6.4: Using the vertex testing method to locate the optimal point
- 6.5: Determining solutions that need integer values
- Summary of key points
- Chapter 7: Matchings
- 7.1: Modelling matching problems using a bipartite graph
- 7.2: Using the maximum matching algorithm, starting from an initial matching
- Summary of key points
- Review Exercise 2
- Examination style paper
- Answers
- Index
