KS5 Mathematics - User contributions [en-gb]

File:Revision quiz -d1 q2.pptx

2014-07-11T09:35:49Z

WRA: WRA uploaded a new version of "File:Revision quiz -d1 q2.pptx"

File:Revision quiz -d1 q2.pptx

2014-07-11T09:34:17Z

WRA: WRA uploaded a new version of "File:Revision quiz -d1 q2.pptx"

D1 Revision

2014-07-11T09:33:53Z

WRA:

[[File:Revision_quiz_-d1.docx]]
[[File:Revision_quiz_d1.pptx]]
[[File:Revision_quiz_-d1.pdf]]
[[File:Revision_quiz_-_Mon.docx]]

D1 Revision

2014-07-11T09:29:22Z

WRA:

[[File:Revision_quiz_-d1.docx]]
[[File:Revision_quiz_d1.pptx]]
[[File:Revision_quiz_-d1.pdf]]

File:Revision quiz -d1.pdf

2014-07-11T09:21:53Z

WRA:

D1 Linear Programming

2014-07-11T09:18:41Z

WRA: /* Supporting activities */

Part of [[D1]]
== Objectives ==
<onlyinclude>
*Formulation of linear programming problems
*Solution of two variable linear programming problems by ruler or vertex methods
*Consideration of problems with integer solutions
</onlyinclude>

== Preparation ==
== Supporting activities ==
[[File:Linear_programming_Matching_Activity_d1.pdf]]
[[File:Formulating_lin._prog..pdf]]

== Consolidation ==
== Homework ==
== Key questions ==
== Assessment ==
== Notes ==

D1 Route Inspection

2014-07-11T09:17:11Z

WRA: /* Supporting activities */

Part of [[D1]]
== Objectives ==
<onlyinclude>
*Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex. The network will have up to four odd nodes
</onlyinclude>

== Preparation ==
== Supporting activities ==
[[File:Route_inspection.pdf]]

== Consolidation ==
== Homework ==
== Key questions ==
== Assessment ==
== Notes ==
Consider all pairings of odd nodes by inspection.

D1

2014-07-11T09:00:44Z

WRA: /* Revision */

==[[D1 Algorithms|Algorithms]]==
{{:D1 Algorithms}}
==[[D1 Critical Path Analysis|Critical Path Analysis]]==
{{:D1 Critical Path Analysis}}
==[[D1 Linear Programming|Linear Programming]]==
{{:D1 Linear Programming}}
==[[D1 Matchings|Matchings]]==
{{:D1 Matchings}}
==[[D1 Networks|Networks]]==
{{:D1 Networks}}
==[[D1 Route Inspection|Route Inspection]]==
{{:D1 Route Inspection}}
==[[D1 Revision|Revision]]==

[[Category: Module]]
[[File:Revision_quiz_-d1_q2.pptx]]
[[File:Revision_quiz_-_Mon.pdf]]

D1

2014-07-11T08:59:23Z

WRA: /* Revision */

File:Formulating lin. prog..pdf

2014-07-11T08:57:30Z

WRA:

File:Revision quiz - Mon.pdf

2014-07-11T08:55:40Z

WRA:

File:Route inspection.pdf

2014-07-11T08:54:03Z

WRA:

File:Revision quiz - Mon.docx

2014-07-11T08:53:44Z

WRA: WRA uploaded a new version of "File:Revision quiz - Mon.docx"

File:Revision quiz -d1 q2.pptx

2014-07-11T08:53:19Z

WRA:

D1 Revision

2014-07-11T08:52:28Z

WRA:

[[File:Revision_quiz_-d1.docx]]
[[File:Revision_quiz_d1.pptx]]

File:Revision quiz d1.pptx

2014-07-11T08:50:14Z

WRA:

D1 Linear Programming

2014-07-11T08:49:37Z

WRA: /* Supporting activities */

Part of [[D1]]
== Objectives ==
<onlyinclude>
*Formulation of linear programming problems
*Solution of two variable linear programming problems by ruler or vertex methods
*Consideration of problems with integer solutions
</onlyinclude>

== Preparation ==
== Supporting activities ==
[[File:Linear_programming_Matching_Activity_d1.pdf]]

== Consolidation ==
== Homework ==
== Key questions ==
== Assessment ==
== Notes ==

File:Linear programming Matching Activity d1.pdf

2014-07-11T08:48:05Z

WRA:

File:Revision quiz - Mon.docx

2014-07-09T11:35:15Z

WRA:

D1 Revision

2014-07-09T11:33:24Z

WRA: Created page with "File:Revision_quiz_-d1.docx"

[[File:Revision_quiz_-d1.docx]]

D1

2014-07-09T11:33:00Z

WRA:

File:Revision quiz -d1.docx

2014-07-09T11:19:31Z

WRA:

S1 Representation and Summary

2014-01-06T14:46:11Z

WRA: /* Notes */

Part of [[S1]]
== Objectives ==
<onlyinclude>
*Using histograms, stem and leaf diagrams and box plots to compare distributions
*Back-to-back stem and leaf diagrams may be required
*Measures of location (mean, median, mode)
*Drawing simple inferences and give interpretations to measures of location and dispersion
*Data may be discrete, continuous, grouped or ungrouped
*Understanding and use of coding
*Measures of dispersion (variance, standard deviation, range and interpercentile ranges)
*Simple interpolation
*Interpretation of measures of location and dispersion
*Skewness
*Concepts of outliers. Location of outliers on a box plot
</onlyinclude>
== Preparation ==
[[File:Statistics_glossary.docx]]

== Supporting activities ==

[[File:Msv-1.pdf|MSV 1]] MSV activity on histograms.

[[File:Climate_data_UK.xlsx]]Sample data

== Consolidation ==
== Homework ==
== Key questions ==

== Assessment ==
== Notes ==

http://hansrosling.com Great videos

<math>\sigma=\sqrt{\frac{\sum{x^2}}{n}-\mu^2}</math>

http://www.ted.com/talks/hans_rosling_shows_the_best_stats_you_ve_ever_seen.html

C1 Differentiation

2014-01-06T14:41:13Z

WRA: /* Supporting activities */

Part of [[C1]]
== Objectives ==
<onlyinclude>
*The derivative of <math>f(x)</math> as the gradient of the tangent to the graph of <math>y = f(x)</math> at a point.
*Definition of derivative as limit.
*Interpretation as a rate of change.
*Second derivative.
*Applications of differentiation to gradients, tangents and normals.
</onlyinclude>
== Preparation ==
== Supporting activities ==
[http://www.s253053503.websitehome.co.uk/risps/risp36.html Risp 36 First steps into differentiation]
[[File:C1_tangents_worksheet.docx]]

== Consolidation ==
== Homework ==
== Key questions ==
=== Quadratics ladder ===
# <math>y=x^2+2x+5</math>. What are <math>y</math> and <math>\frac{dy}{dx}</math> when <math>x=3</math>?
# <math>y=x^2-6x+9</math>. What are <math>x</math> and <math>\frac{dy}{dx}</math> when <math>y=1</math>?
# <math>y=x^2+2x-35</math>. What are <math>x</math> and <math>y</math> when <math>\frac{dy}{dx}=4</math>?
# <math>C:\,y=x^2-x-6</math>. Find an equation for the tangent <math>l</math> to <math>C</math> at the point <math>P</math> whose <math>x</math>-coordinate is <math>5</math>.
# <math>C:\,y=3x^2-5x-10</math>. Point <math>P</math> is on <math>C</math>, where <math>x=-3</math>. Find the coordinates of <math>Q</math>, where the normal to <math>C</math> at <math>P</math> intersects <math>C</math> again.

== Assessment ==

File:C1 tangents worksheet.docx

2014-01-06T14:37:53Z

WRA: exam questions on tangents c1

exam questions on tangents c1