Hodder Education
Edexcel A Level Further Mathematics Decision
Science & Math
Edexcel A Level Further Mathematics Decision
US$ 32.39
The publisher has enabled DRM protection, which means that you need to use the BookFusion iOS, Android or Web app to read this eBook. This eBook cannot be used outside of the BookFusion platform.
Description
Contents
Reviews

Whiteboard eTextbooks are online, interactive versions of the printed textbooks that are ideal for front-of-class teaching and lesson planning. The Whiteboard eTextbooks link seamlessly with MEI Integral Further Mathematics online resources, allowing you to move with ease between corresponding topics in the eTextbooks and Integral.

Integral has been developed by MEI and supports teachers and students with high quality teaching and learning activities, including dynamic resources and self-marking tests and assessments that cover the new specifications.

To have full access to the eTextbooks and Integral resources you must be subscribed to both Dynamic Learning and Integral. To subscribe to Integral, visit www.integralmaths.org.
For more information on our eTextbooks and Integral please see the Quick Links box.

Provide full support for the Edexcel Decision content of the new specification with worked examples, stimulating activities and assessment support to help develop understanding, reasoning and problem solving.
- Help prepare students for assessment with skills-building activities and fully worked examples and solutions tailored to the changed criteria.
- Build understanding through carefully worded expositions that set out the basics and the detail of each topic, with call-outs to add clarity.
- Test knowledge and develop understanding, reasoning and problem solving with banded Exercise questions that increase in difficulty (answers provided in the back of the book and online).
- Gain a full understanding of the logical steps that are used in creating each individual algorithm
- Encourages students to track their progress using learning outcomes and Key Points listed at the end of each chapter.

Language
English
ISBN
9781510433380
Cover
Title Page
Copyright
Contents
Getting the most from this book
Prior knowledge
1 Algorithms and graph theory
1.1 About algorithms
1.2 Packing and sorting
1.3 Types of graphs
1.4 Planarity of graphs
2 Algorithms on graphs
2.1 The minimum connector problem
2.2 The route inspection problem
2.3 Dijkstra’s algorithm
2.4 Floyd’s algorithm
2.5 The travelling salesperson problem
3 Critical path analysis
3.1 Constructing an activity network
3.2 Critical paths and Gantt charts
3.3 Using Gantt charts
4 Linear programming
4.1 Solving linear programming problems
4.2 The Simplex algorithm
4.3 Advanced Simplex methods
5 Allocation problems
5.1 Cost matrix reduction
5.2 The Hungarian algorithm
5.3 Modifications
5.4 Formulation as a linear programming problem
6 Recurrence relations
6.1 Solving first-order recurrence relations
6.2 Solving second-order recurrence relations
6.3 Generating functions
7 Network flows
7.1 The language of network flows
7.2 Flow augmenting
7.3 Refinements
8 Game theory
8.1 Pay-off matrices
8.2 Dominated strategies
8.3 Optimal mixed strategies
8.4 Converting games to linear programming problems
9 Transportation problems
9.1 Finding initial solutions
9.2 Finding an improved solution
9.3 Formulation as a linear programming problem
10 Dynamic programming
10.1 Principles of dynamic programming
10.2 Solving problems using dynamic programming
11 Decision analysis
11.1 Decision analysis
Answers
The book hasn't received reviews yet.