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
›
GCSE Revision Video 27 - Recipe & Proportion
GCSE Revision Video 27 - Recipe & Proportion
OCR MEI Statistics 1 5.05 Notes on Less Than / Greater Than / At Most / At Least
AQA Decision 1 6.02 Bipartite Graphs and the Alternating Path Algorithm
I introduce the alternating path algorithm to find a complete matching for a bipartite graph.
AQA Decision 1 6.01 Introducing Bipartite Graphs and Adjacency Matrices
I introduce the concept of bipartite graphs and how these can be represented using an adjacency matrix.
AQA Decision 1 5.03 Dijkstra's Algorithm: a third example
I work through a third example of using Dijkstra's algorithm.
AQA Decision 1 5.02 Dijkstra's Algorithm: a second example
I work through a second example of using Dijkstra's algorithm.
AQA Decision 1 4.03b Prim's Algorithm from a Matrix: a second example
I work through a second example of using Prim's algorithm on a matrix.
AQA Decision 1 4.03a Prim's Algorithm from a Matrix
I show how Prim's algorithm can be used on a matrix.
AQA Decision 1 4.02b Prim's Algorithm: a second example
I work through a second example of using Prim's algorithm.
AQA Decision 1 4.01b Kruskal's Algorithm: a second example
I work through a second example of using Kruskal's Algorithm to find a minimum spanning tree.
AQA Decision 1 4.01a Introducing Minimum Spanning Trees and Kruskal's Algorithm
I introduce the concept of finding a minimum spanning tree for a network by working through an example of Kruskal's Algorithm.
AQA Decision 1 3.02 Eulerian, Semi-Eulerian and Not Eulerian Graphs
I introduce the concept of an Eulerian graph and what this means.
AQA Decision 1 3.01 Introducing Graph Theory: The Bridges of Konigsberg Problem
I introduce the initial basis for Graph Theory: Leonhard Euler's Bridges of Konigsberg problem.
AQA Decision 1 2.04b Quick Sort: a second example
I work through a second example of using Quick Sort.
AQA Decision 1 2.04a Quick Sort: introducing live and dead pivots
I introduce my method for Quick Sort, making it clear which numbers are used as pivots.
D1 Q1 June 2013 Edexcel Maths A-Level
D1 Q1 June 2013 Edexcel Maths A-Level
AQA Decision 1 2.03c Shell Sort - an example with 7 numbers
I work through an example of using shell sort with 7 numbers. This is an unusual amount of numbers to have for this exam board - usually they examine either 8 n...
D1 Q2 June 2013 Edexcel Maths A-Level
D1 Q2 June 2013 Edexcel Maths A-Level
AQA Decision 1 2.03b Shell Sort - an example with 10 numbers
I work through an example of using Shell Sort with 10 numbers.
AQA Decision 1 2.03a Shell Sort - an example with 8 numbers
I introduce using shell sort and explain the underlying shuttle sorts that are being used.
D1 Q3 June 2013 Maths A-Level Edexcel
D1 Q3 June 2013 Maths A-Level Edexcel
AQA Core 3 9.04 Converging & Diverging: Staircase & Cobweb Diagrams
I look at ideas of convergence and divergence, and how this affects staircase and cobweb diagrams.
D1 Q6 June 2013 Maths A-Level Edexcel
D1 Q6 June 2013 Maths A-Level Edexcel
AQA Core 3 9.03 Introducing a Cobweb Diagram
I work through another example in which a Cobweb Diagram is produced.
AQA Decision 1 2.02b Shuttle Sort: a second example
I work through a second example of using Shuttle Sort, this time working with a list of numbers in DESCENDING order.
AQA Core 2 5.16 How many terms in a Geometric Sequence
D1 Q5 June 2013 Maths A-Level Edexcel
D1 Q5 June 2013 Maths A-Level Edexcel
AQA Statistics 1 6.04 Estimation and finding a 90% Confidence Interval
AQA Core 3 9.02 Introducing a Staircase Diagram
I introduce a numerical method to solve equations, including how this process can be sped up using a calculator, as well as represented graphically using a Stai...
D1 Q7 June 2013 Maths A-Level Edexcel
D1 Q7 June 2013 Maths A-Level Edexcel
AQA Core 2 5.15 Geometric Sequences: Finding a and r
AQA Statistics 1 6.03 Given a large Sample, find a 99% Confidence Interval
AQA Core 3 9.01b What if f(a) and f(b) are BOTH positive or BOTH negative?
I discuss the possibility that f(a) and f(b) are both the same sign and what this would mean.
D1 Q2 June 2013 (Replacement) Edexcel Maths A-Level
D1 Q2 June 2013 (Replacement) Edexcel Maths A-Level
AQA Decision 1 2.01b Bubble Sort: a second example
I look at an example of using Bubble Sort when the algorithm ends earlier than may be expected.
AQA Core 2 5.14 Finding the nth term for a Geometric Sequence
AQA Statistics 1 6.02 Given a Sample, find a 98% Confidence Interval
D1 Q1 June 2013 (Replacement) Edexcel Maths A-Level
D1 Q1 June 2013 (Replacement) Edexcel Maths A-Level
AQA Core 3 8.02b Solids of Revolution: Revolving about the y-axis
I work through three examples of revolving a curve about the y-axis.
D1 Q6 June 2013 (Replacement) Edexcel Maths A-Level
D1 Q6 June 2013 (Replacement) Edexcel Maths A-Level
AQA Decision 1 1.01 Tracing an Algorithm
I introduce the concept of algorithms as a set of instructions and work through an example of tracing an algorithm, showing how it can be set out.
AQA Statistics 1 5.07 Calculating Estimators for the Mean and Variance using sigma notation
AQA Core 2 5.12a Using Sigma Notation for Arithmetic Series
D1 Q7 June 2013 (Replacement) Edexcel Maths A-Level
D1 Q7 June 2013 (Replacement) Edexcel Maths A-Level
AQA Core 3 8.01b Solids of Revolution: Revolving about the x-axis
I work through a pair of examples of revolving a curve about the x-axis and calculating the volume formed.
AQA Statistics 1 5.06 Calculating Estimators for the Mean and Variance from raw data (TI-82 STATS)
D1 Q5 June 2013 (Replacement) Edexcel Maths A-Level
D1 Q5 June 2013 (Replacement) Edexcel Maths A-Level
AQA Core 3 8.01a Introducing Solids of Revolution: Revolving about the x-axis
I introduce the idea of forming a solid by revolving a curve about the x-axis.
AQA Core 2 5.10 Arithmetic Series: Finding a and d
D1 Q4 June 2013 (Replacement) Edexcel Maths A-Level
D1 Q4 June 2013 (Replacement) Edexcel Maths A-Level
‹
1
2
3
4
5
6
7
8
...
40
41
›
Go back to all lesson plans