BOOK
Edexcel AS and A level Further Mathematics Decision Mathematics 1
Susie Jameson | Peter Sherran | Kwith Pledger | Harry Smith
(2017)
Additional Information
Book Details
Abstract
Exam Board: Edexcel
Level: AS and A level
Subject: Further Mathematics
First teaching: September 2017
First exams: Summer 2018
With over 1.3 million copies sold of the previous edition, Pearson’s textbooks are the market-leading and most trusted resources for AS and A level Further Mathematics.
This book covers all the content needed for the optional Edexcel AS and A level Decision Mathematics 1 exams.
- Fully updated to match the 2017 specifications, with more of a focus on problem-solving and modelling.
-
FREE additional online content to support your independent learning, including full worked solutions for every question in the book (SolutionBank) and GeoGebra interactives.
-
Includes access to an online digital edition (valid for 3 years once activated).
-
Includes worked examples with guidance, lots of exam-style questions, practice papers, and plenty of mixed and review exercises.
Table of Contents
| Section Title | Page | Action | Price |
|---|---|---|---|
| Front Cover | Front Cover | ||
| Contents | iii | ||
| Overarching themes | iv | ||
| Extra online content | vi | ||
| Chapter 1: Algorithms | 1 | ||
| 1.1: Using and understanding algorithms | 2 | ||
| 1.2: Flow charts | 6 | ||
| 1.3: Bubble sort | 10 | ||
| 1.4: Quick sort | 13 | ||
| 1.5: Bin-packing algorithms | 16 | ||
| 1.6: Order of an algorithm | 21 | ||
| Mixed exercise: 1 | 25 | ||
| Chapter 2: Graphs and networks | 29 | ||
| 2.1: Modelling with graphs | 30 | ||
| 2.2: Graph theory | 34 | ||
| 2.3: Special types of graph | 38 | ||
| 2.4: Representing graphs and networks using matrices | 41 | ||
| 2.5: The planarity algorithm | 43 | ||
| Mixed exercise: 2 | 48 | ||
| Chapter 3: Algorithms on graphs | 52 | ||
| 3.1: Kruskal’s algorithm | 53 | ||
| 3.2: Prim’s algorithm | 57 | ||
| 3.3: Applying Prim’s algorithm to a distance matrix | 60 | ||
| 3.4: Using Dijkstra’s algorithm to find the shortest path | 66 | ||
| 3.5: Floyd’s algorithm | 73 | ||
| Mixed exercise: 3 | 79 | ||
| Chapter 4: Route inspection | 85 | ||
| 4.1: Eulerian graphs | 86 | ||
| 4.2: Using the route inspection algorithm | 89 | ||
| 4.3: Networks with more than four odd nodes | 94 | ||
| Mixed exercise: 4 | 98 | ||
| Chapter 5: The travelling salesman problem | 102 | ||
| 5.1: The classical and practical travelling salesman problems | 103 | ||
| 5.2: Using a minimum spanning tree method to find an upper bound | 107 | ||
| 5.3: Using a minimum spanning tree method to find a lower bound | 114 | ||
| 5.4: Using the nearest neighbour algorithm to find an upper bound | 118 | ||
| Mixed exercise: 5 | 123 | ||
| Review exercise: 1 | 128 | ||
| Chapter 6: Linear programming | 138 | ||
| 6.1: Linear programming problems | 139 | ||
| 6.2: Graphical methods | 145 | ||
| 6.3: Locating the optimal point | 149 | ||
| 6.4: Solutions with integer values | 162 | ||
| Mixed exercise: 6 | 167 | ||
| Chapter 7: The simplex algorithm | 171 | ||
| 7.1: Formulating linear programming problems | 172 | ||
| 7.2: The simplex method | 176 | ||
| 7.3: Problems requiring integer solutions | 196 | ||
| 7.4: Two-stage simplex method | 199 | ||
| 7.5: The Big-M method | 205 | ||
| Mixed exercise: 7 | 213 | ||
| Chapter 8: Critical path analysis | 221 | ||
| 8.1: Modelling a project | 222 | ||
| 8.2: Dummy activities | 226 | ||
| 8.3: Early and late event times | 230 | ||
| 8.4: Critical activities | 232 | ||
| 8.5: The float of an activity | 236 | ||
| 8.6: Gantt charts | 238 | ||
| 8.7: Resource histograms | 242 | ||
| 8.8: Scheduling diagrams | 249 | ||
| Mixed exercise: 8 | 253 | ||
| Review exercise: 2 | 259 | ||
| Exam-style practice: AS | 269 | ||
| Exam-style practice: A level | 271 | ||
| Answers | 275 | ||
| Index | 337 | ||
| Back Cover | Back Cover |