19:33
1.1 Understanding and using algorithms (DECISION 1 - Chapter 1: Algorithms)
Hinds Maths
22:11
1.2 Flowcharts (DECISION 1 - Chapter 1: Algorithms)
20:17
1.3 Bubble sort (DECISION 1 - Chapter 1: Algorithms)
18:50
1.4 Quick sort (DECISION 1 - Chapter 1: Algorithms)
31:22
1.5 Bin packing algorithms (DECISION 1 - Chapter 1: Algorithms)
20:09
1.6 Order of an algorithm (DECISION 1 - Chapter 1: Algorithms)
10:24
2.1 Modelling with graphs (DECISION 1 - Chapter 2: Graphs and networks)
16:08
2.2 Graph theory (DECISION 1 - Chapter 2: Graphs and networks)
5:05
2.3 Special types of graph (DECISION 1 - Chapter 2: Graphs and networks)
14:08
2.4 Representing graphs and networks using matrices (DECISION 1 - Chapter 2: Graphs and networks)
20:53
2.5 The planarity algorithm (DECISION 1 - Chapter 2: Graphs and networks)
13:03
3.1 Kruskal's algorithm (DECISION 1 - Chapter 3: Algorithms on graphs)
4:45
3.2 Prim's algorithm (DECISION 1 - Chapter 3: Algorithms on graphs)
17:26
3.3 Applying Prim's algorithm to a distance matrix (DECISION 1 - Chapter 3: Algorithms on graphs)
39:22
3.4 Using Dijkstra's algorithm to find the shortest path (D1 - Chapter 3: Algorithms on graphs)
21:48
3.5 Floyd's algorithm (DECISION 1 - Chapter 3: Algorithms on graphs)
11:21
4.1 Eulerian graphs (DECISION 1 - Chapter 4: Route inspection)
24:35
4.2 Using the route inspection algorithm (DECISION 1 - Chapter 4: Route inspection)
17:20
4.3 Networks with more than four odd nodes (DECISION 1 - Chapter 4: Route inspection)
13:06
5.1 The classical and practical travelling salesman problems (DECISION 1 - Chapter 5)
23:23
5.2 Using a minimum spanning tree method to find an upper bound (DECISION 1 - Chapter 5)
21:54
5.3 Using a minimum spanning tree method to find a lower bound (DECISION 1 - Chapter 5)
16:43
5.4 Using the nearest neighbour algorithm to find an upper bound (DECISION 1 - Chapter 5)
26:25
6.1 Linear programming problems (DECISION 1 - Chapter 6: Linear programming)
10:00
6.2 Graphical methods (DECISION 1 - Chapter 6: Linear programming)
41:41
6.3 Locating the optimal point (DECISION 1 - Chapter 6: Linear programming)
15:43
6.4 Solutions with integer values (DECISION 1 - Chapter 6: Linear programming)
20:18
7.1 Formulating linear programming problems (DECISION 1 - Chapter 7: The simplex algorithm)
53:29
7.2 The simplex method (DECISION 1 - Chapter 7: The simplex algorithm)
11:28
7.3 Problems requiring integer solutions (DECISION 1 - Chapter 7: The simplex algorithm)
43:18
7.4 Two stage simplex method (DECISION 1 - Chapter 7: The simplex algorithm)
37:40
7.5 The Big-M method (DECISION 1 - Chapter 7: The simplex algorithm)
17:16
8.1 Modelling a project (DECISION 1 - Chapter 8: Critical path analysis)
9:31
8.2 Dummy activities (DECISION 1 - Chapter 8: Critical path analysis)
12:20
8.3 Early and late event times (DECISION 1 - Chapter 8: Critical path analysis)
8:13
8.4 Critical activities (DECISION 1 - Chapter 8: Critical path analysis)
6:05
8.5 The float of an activity (DECISION 1 - Chapter 8: Critical path analysis)
8.6 Gantt charts (DECISION 1 - Chapter 8: Critical path analysis)
21:15
8.7 Resource histograms (DECISION 1 - Chapter 8: Critical path analysis)
16:30
8.8 Scheduling diagrams (DECISION 1 - Chapter 8: Critical path analysis)
50:50
AS Further Maths - Decision 1 (D1): Further Mathematics - Specimen paper (Edexcel)
1:34:41
A Level Further Maths - Decision 1 (D1): Further Mathematics - Specimen paper (Edexcel)
