PRICING
Log in
Join using code
Shared lesson activities for 'After the Race' from Joyce's Dubliners: Summary & Analysis
Go back to all lesson plans
‹
1
2
3
4
5
6
7
8
...
40
41
›
AQA Core 2 7.03 Calculating the Area of a Triangle
AQA Core 2 7.02 Using the Cosine Rule to find a Missing Side or Angle
AQA Core 2 7.01 Using the Sine Rule to find a Missing Side or Angle
AQA Core 2 6.07 Expanding a Product of Binomial Expansions
AQA Core 2 6.06 Finding a specific Coefficient in a Binomial Expansion
AQA Core 2 6.04 The Link between nCr and Pascal's Triangle
AQA Core 2 6.03 Another Example of Binomial Expansion using Pascal's Triangle
AQA Core 2 6.02 Binomial Expansion using Pascal's Triangle
AQA Core 3 9.05 The Mid-Ordinate Rule & an Overestimate or Underestimate?
I work through an example of using the Mid-Ordinate Rule and then explain how you can tell whether it has given an overestimate or an underestimate.
OCR MEI Statistics 1 7.08 The Inter-Quartile Range and Outliers
AQA Core 2 6.01 Introducing Binomial Expansion and Pascal's Triangle
OCR MEI Statistics 1 7.07 The Mid-Range
AQA Core 2 5.22 A Problem involving the Sum to Infinity
OCR MEI Statistics 1 7.06 Measures of Central Tendency
AQA Core 2 5.21 An Example of Summing to Infinity
OCR MEI Statistics 1 7.05 QUICK GCSE RECAP: Stem & Leaf Diagrams
AQA Core 2 5.20 Introducing Summing to Infinity
OCR MEI Statistics 1 7.04 QUICK GCSE RECAP: Histograms & Estimating the Mean and Median
AQA Core 2 5.19 Using Sigma Notation for Geometric Series
OCR MEI Statistics 1 7.03 QUICK GCSE RECAP: Box Plots / Box and Whisker Diagrams
AQA Core 2 5.18 Summing a Geometric Series
OCR MEI Statistics 1 7.01 A Note on this Section
OCR MEI Statistics 1 6.07 Two-Tail Hypothesis Testing - Comparing with One-Tail method
OCR MEI Statistics 1 6.05 Hypothesis Testing - Critical Region Method - Greater than Example
AQA Decision 1 9.02 Linear Programming: Finding the Inequalities from a worded problem
I work through a worded problem, turning it into a linear programming problem by finding five inequalities and an objective function.
OCR MEI Statistics 1 6.04 Hypothesis Testing - Critical Region Method - Less than Example
AQA Decision 1 9.01 Linear Programming: Drawing Inequalities and the Objective Line
An introduction to Linear Programming, including drawing straight lines on a graph, as well as the Objective Line, and then calculating the maximum for an Objec...
OCR MEI Statistics 1 6.03 Conducting a Hypothesis Test - Greater than Example
AQA Decision 1 8.06b The Travelling Salesperson Problem ex2: Lower Bound Algorithm
I work through a second example of using the Lower Bound Algorithm in order to solve the Travelling Salesperson Problem.
OCR MEI Statistics 1 6.02b Hypothesis Testing: What if there were five coins?
AQA Decision 1 8.06a The Travelling Salesperson Problem ex2: Nearest Neighbour Algorithm
I work through a second example of using the Nearest Neighbour Algorithm, this time without writing anything on the matrix.
OCR MEI Statistics 1 6.02a Conducting a Hypothesis Test - Less than Example
AQA Decision 1 8.05 The Travelling Salesperson Problem: The Lower Bound Algorithm
I work through a first try at the Lower Bound Algorithm and discuss what our result means alongside the upper bound given by the Nearest Neighbour Algorithm
OCR MEI Statistics 1 6.01 Introducing Hypothesis Testing and Significance Levels
AQA Decision 1 8.04 The Travelling Salesperson Problem: The Nearest Neighbour Algorithm
I work through an example of the Nearest Neighbour Algorithm using a matrix and go through what to look out for.
OCR MEI Statistics 1 5.12 Binomial Distribution: Finding the Expected Value and Standard Deviation
AQA Decision 1 8.03 The Travelling Salesperson Problem: An example of a Hamiltonian Cycle / Tour
By inspection, I find a Hamiltonian cycle that may or may not be improved upon as a solution for the Travelling Salesperson Problem
OCR MEI Statistics 1 5.11 Introducing the Variance of a Binomial Distribution
AQA Decision 1 8.02 The Travelling Salesperson Problem: Making a Graph Complete
I work through building up a matrix from a network and filling in the shortest distances.
AQA Decision 1 8.01 The Travelling Salesperson Problem: An Introduction
I introduce the concept of the Travelling Salesperson problem and how we are going to go about attempting to solve it.
OCR MEI Statistics 1 5.10 Introducing the Expected Value of a Binomial Distribution
AQA Decision 1 7.03 Chinese Postman Algorithm: a third example w/extras
I work through a third example of using the Chinese Postman algorithm and throw in a couple of extra part (b) and (c) questions at the end.
OCR MEI Statistics 1 5.09 Binomial Probability: A Worded Problem
AQA Decision 1 7.02 Chinese Postman Algorithm: a second example
OCR MEI Statistics 1 5.08 Binomial Probability: Using the Tables
AQA Decision 1 7.01 Introducing the Chinese Postman Algorithm
I introduce the Chinese Postman algorithm and give an example of how it works for a simple graph.
OCR MEI Statistics 1 5.07 A Guide to Using the Binomial Probability Tables
AQA Decision 1 6.04 Bipartite Graphs: a third (more coherent) example
I work through a third example of finding two alternating paths for a Bipartite graph matching problem.
OCR MEI Statistics 1 5.06 Example: Less than 3, Using the Formula
AQA Decision 1 6.03 Bipartite Graphs: a second example
I work through a second example where two alternating paths need to be found.
‹
1
2
3
4
5
6
7
8
...
40
41
›
Go back to all lesson plans