Edexcel AS and A level Further Mathematics Decision Mathematics 1
1st Edition
Published on 21. November 2017
345 pages
978-1-292-20714-8 (ISBN)
Description
Exam Board: EdexcelLevel: AS and A levelSubject: Further MathematicsFirst teaching: September 2017First exams: Summer 2018With over 1.3 million copies sold of the previous edition, Pearsons 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.
More details
Other editions
Additional editions
Education Limited Pearson
Pearson Edexcel AS and A level Further Mathematics Decision Mathematics 1 Textbook + e-book
Book
11/2017
Pearson Education Limited
€34.00
Shipment within 10-20 days
Content
- Front Cover
- Contents
- Overarching themes
- Extra online content
- Chapter 1: Algorithms
- 1.1: Using and understanding algorithms
- 1.2: Flow charts
- 1.3: Bubble sort
- 1.4: Quick sort
- 1.5: Bin-packing algorithms
- 1.6: Order of an algorithm
- Mixed exercise: 1
- Chapter 2: Graphs and networks
- 2.1: Modelling with graphs
- 2.2: Graph theory
- 2.3: Special types of graph
- 2.4: Representing graphs and networks using matrices
- 2.5: The planarity algorithm
- Mixed exercise: 2
- Chapter 3: Algorithms on graphs
- 3.1: Kruskal's algorithm
- 3.2: Prim's algorithm
- 3.3: Applying Prim's algorithm to a distance matrix
- 3.4: Using Dijkstra's algorithm to find the shortest path
- 3.5: Floyd's algorithm
- Mixed exercise: 3
- Chapter 4: Route inspection
- 4.1: Eulerian graphs
- 4.2: Using the route inspection algorithm
- 4.3: Networks with more than four odd nodes
- Mixed exercise: 4
- Chapter 5: The travelling salesman problem
- 5.1: The classical and practical travelling salesman problems
- 5.2: Using a minimum spanning tree method to find an upper bound
- 5.3: Using a minimum spanning tree method to find a lower bound
- 5.4: Using the nearest neighbour algorithm to find an upper bound
- Mixed exercise: 5
- Review exercise: 1
- Chapter 6: Linear programming
- 6.1: Linear programming problems
- 6.2: Graphical methods
- 6.3: Locating the optimal point
- 6.4: Solutions with integer values
- Mixed exercise: 6
- Chapter 7: The simplex algorithm
- 7.1: Formulating linear programming problems
- 7.2: The simplex method
- 7.3: Problems requiring integer solutions
- 7.4: Two-stage simplex method
- 7.5: The Big-M method
- Mixed exercise: 7
- Chapter 8: Critical path analysis
- 8.1: Modelling a project
- 8.2: Dummy activities
- 8.3: Early and late event times
- 8.4: Critical activities
- 8.5: The float of an activity
- 8.6: Gantt charts
- 8.7: Resource histograms
- 8.8: Scheduling diagrams
- Mixed exercise: 8
- Review exercise: 2
- Exam-style practice: AS
- Exam-style practice: A level
- Answers
- Index
- Back Cover
