Specification points
OCR AS Level Further Mathematics B (MEI) H635
217 points in 6 topics, with OCR's codes and titles.
Codes and titles are read by a script from OCR's published specification and have not been checked by a person. What each point covers is in the specification itself: OCR’s specification.
Y410 Core Pure
- Y410.1 Core pure: proof
- Y410/Pp4 Proof by induction for formulae
- Y410.2 Core pure: complex numbers
- Y410/Pj1 Language of complex numbers
- Y410/Pj2 Quadratics with real coefficients
- Y410/Pj3 Conjugate pairs of complex roots
- Y410/Pj4 Arithmetic with complex numbers
- Y410/Pj5 Complex number equal to zero
- Y410/Pj6 Radians and complex numbers
- Y410/Pj7 Modulus-argument form
- Y410/Pj8 Multiplying and dividing in modulus-argument form
- Y410/Pj9 Argand diagrams and conjugates
- Y410/Pj10 Sums and products on an Argand diagram
- Y410/Pj11 Simple loci on an Argand diagram
- Y410.3 Core pure: matrices and transformations
- Y410/Pm1 Adding and multiplying matrices
- Y410/Pm2 Zero, identity and equal matrices
- Y410/Pm3 Matrix multiplication: associative, not commutative
- Y410/Pm4 Matrices of linear transformations
- Y410/Pm5 Successive transformations and matrix products
- Y410/Pm6 Invariant points and lines
- Y410/Pm7 Determinants and singular matrices
- Y410/Pm8 Determinant as area scale factor
- Y410/Pm9 Determinant as volume scale factor
- Y410/Pm10 Determinant of a product
- Y410/Pm11 Inverse matrices
- Y410/Pm12 Calculating inverse matrices
- Y410/Pm13 Using inverse matrices
- Y410/Pm14 Inverse of a product of matrices
- Y410.4 Core pure: vectors and 3-D space
- Y410/Pv1 Scalar product
- Y410/Pv2 Vector and cartesian equations of a plane
- Y410/Pv3 Normal vectors to a plane
- Y410/Pv4 Arrangements of three planes
- Y410/Pv5 Three simultaneous equations by inverse matrix
- Y410/Pv6 Angle between two planes
- Y410.5 Core pure: algebra
- Y410/Pa1 Roots and coefficients of polynomials
- Y410/Pa2 Transforming roots of equations
- Y410.6 Core pure: series
- Y410/Ps1 Summing series: standard formulae and differences
Y411 Mechanics a (Y411)
- Y411.1 Mechanics a: dimensional analysis
- Y411/Mq1 Dimensions in terms of M, L and T
- Y411/Mq2 Dimensionless quantities
- Y411/Mq3 Units from dimensions
- Y411/Mq4 Changing units
- Y411/Mq5 Checking consistency with dimensions
- Y411/Mq6 Finding unknown indices by dimensional analysis
- Y411/Mq7 Models from dimensional analysis
- Y411.2 Mechanics a: forces
- Y411/Md1 Friction and normal contact force
- Y411/Md2 Total contact force and friction
- Y411/Md3 Friction model F ≤ μR
- Y411/Md4 Body on a rough slope
- Y411/Md5 Newton's laws with friction
- Y411/Md6 Resolving forces
- Y411/Md7 Resultant of concurrent forces
- Y411/Md8 Equilibrium under concurrent forces
- Y411/Md9 Closed force figures in equilibrium
- Y411/Md10 Solving equilibrium problems
- Y411/Md11 Force diagrams for rigid bodies
- Y411/Md12 Turning effect of forces
- Y411/Md13 Couples
- Y411/Md14 Moments about an axis
- Y411/Md15 Equilibrium of a rigid body
- Y411/Md16 Sliding or toppling
- Y411.3 Mechanics a: work, energy and power
- Y411/Mw1 Language of work, energy and power
- Y411/Mw2 Work done along a line of action
- Y411/Mw3 Work done at an angle
- Y411/Mw4 Kinetic energy
- Y411/Mw5 Gravitational potential energy
- Y411/Mw6 Conservation of energy
- Y411/Mw7 Work-energy principle
- Y411/Mw8 Power as rate of doing work
- Y411.4 Mechanics a: momentum and impulse
- Y411/Mi1 Impulse as a vector
- Y411/Mi2 Linear momentum as a vector
- Y411/Mi3 Impulse-momentum equation
- Y411/Mi4 Conservation of linear momentum
- Y411/Mi5 Direct impact assumptions
- Y411/Mi6 Momentum in direct impacts
- Y411/Mi7 Newton's experimental law and coefficient of restitution
- Y411/Mi8 Perfectly inelastic impacts (e = 0)
- Y411/Mi9 Newton's experimental law in direct impacts
- Y411/Mi10 Modelling direct impacts
- Y411/Mi11 Perfectly elastic impacts (e = 1)
- Y411/Mi12 Kinetic energy loss in impacts
- Y411.5 Mechanics a: centre of mass
- Y411/MG1 Centre of mass of particles
- Y411/MG2 Centre of mass by symmetry
- Y411/MG3 Centres of mass of standard shapes
- Y411/MG4 Centre of mass of composite bodies
- Y411/MG5 Centre of mass and equilibrium
Y412 Statistics a (Y412)
- Y412.1 Statistics a: sampling
- Y412/Sx1 Sample size in experimental design
- Y412/Sx2 Why sampling is necessary
- Y412/Sx3 Advantage of random samples
- Y412.2 Statistics a: discrete random variables
- Y412/SR1 Discrete probability functions
- Y412/SR2 Expectation of a discrete variable
- Y412/SR3 Variance of a discrete variable
- Y412/SR4 Expectation of a linear function
- Y412/SR5 Variance of a linear function
- Y412/SR6 Linear combinations of independent variables
- Y412/SR7 When to use a discrete uniform model
- Y412/SR8 Discrete uniform probabilities
- Y412/SR9 Mean and variance of a discrete uniform distribution
- Y412/SR10 When to use a binomial model
- Y412/SR11 When to use a Poisson model
- Y412/SR12 Poisson and binomial as alternative models
- Y412/SR13 Poisson probabilities
- Y412/SR14 Mean and variance of a Poisson distribution
- Y412/SR15 Sum of independent Poisson variables
- Y412/SR16 When to use a geometric model
- Y412/SR17 Geometric probabilities
- Y412/SR18 Mean and variance of a geometric distribution
- Y412.3 Statistics a: bivariate data
- Y412/Sb1 Bivariate data and choice of axes
- Y412/Sb2 Scatter diagrams
- Y412/Sb3 Scatter diagrams from software
- Y412/Sb4 Calculating the pmcc
- Y412/Sb5 When to test with the pmcc
- Y412/Sb6 Hypothesis tests using the pmcc
- Y412/Sb7 The pmcc as an effect size
- Y412/Sb8 Spearman's rank correlation coefficient
- Y412/Sb9 Hypothesis tests with Spearman's coefficient
- Y412/Sb10 Choosing between r and rₛ
- Y412/Sb11 Least squares regression line
- Y412/Sb12 Using a regression line to estimate
- Y412/Sb13 Regression lines y on x and x on y
- Y412/Sb14 Checking model fit
- Y412/Sb15 Relationship between the two regression lines
- Y412.4 Statistics a: chi-squared tests
- Y412/Sb16 Contingency tables
- Y412/SH1 Chi-squared test for contingency tables
- Y412/SH2 Interpreting chi-squared contingency table results
- Y412/SH3 Chi-squared goodness of fit tests
- Y412/SH4 Interpreting chi-squared goodness of fit results
Y413 Modelling with Algorithms
- Y413.1 Modelling with algorithms: algorithms
- Y413/MA1 What an algorithm is
- Y413/MA2 Interpreting algorithms in different formats
- Y413/MA3 Repairing and adapting algorithms
- Y413/MA4 Algorithmic complexity
- Y413/MA5 Proving algorithms correct or incorrect
- Y413/MA6 Heuristics
- Y413/MA7 Quick sort and other sorting algorithms
- Y413/MA8 Counting comparisons and swaps in sorting
- Y413/MA9 Reasoning about sorting algorithms
- Y413/MA10 Bin packing algorithms
- Y413/MA11 Comparisons in packing algorithms
- Y413.2 Modelling with algorithms: networks
- Y413/MN1 Graphs and their language
- Y413/MN2 Modelling with graphs
- Y413/MN3 Networks as weighted graphs
- Y413/MN4 Modelling with networks
- Y413/MN5 Kruskal's and Prim's algorithms
- Y413/MN6 Dijkstra's algorithm
- Y413/MN7 Complexity of network algorithms
- Y413/MN8 Activity-on-arc networks
- Y413/MN9 Critical path analysis
- Y413/MN10 Networks as transmission systems
- Y413/MN11 Cuts and their capacity
- Y413/MN12 Maximum flow/minimum cut theorem
- Y413/MN13 Exploring network algorithms with software
- Y413.3 Modelling with algorithms: linear programming
- Y413/AL1 Language of linear programming
- Y413/AL2 Formulating linear programmes
- Y413/AL3 Standard form of an LP
- Y413/AL4 Slack variables and augmented form
- Y413/AL5 Integer solutions to LPs
- Y413/AL6 Network problems as LPs
- Y413/AL7 Feasible regions in 2-D
- Y413/AL8 Graphical solution of 2-D LPs
- Y413/AL9 Modifying constraints or objective
- Y413/AL10 Simple integer LPs solved graphically
- Y413/AL11 Visualising 3-D LPs
- Y413/AL12 The simplex algorithm
- Y413/AL13 Geometric basis of the simplex method
- Y413/AL14 Two-stage simplex method
- Y413/AL15 Equality constraints as two inequalities
- Y413/AL16 Negative variables and minimisation in LPs
- Y413/AL17 Methods for solving large LPs
- Y413/AL18 Interpreting LP software output
Y414 Numerical Methods
- Y414.1 Numerical methods: use of technology
- Y414/NQ1 Spreadsheets for numerical methods
- Y414/NQ2 Iterating with a calculator
- Y414.2 Numerical methods: errors
- Y414/NU1 Errors in arithmetic operations
- Y414/NU2 Error in a function of x
- Y414/NU3 Order of operations and errors
- Y414/NU4 Limited precision in computers
- Y414/NU5 Subtracting nearly equal quantities
- Y414/NU6 Rounding and chopping
- Y414/NU7 Convergence and order of convergence
- Y414/NU8 Error analysis to improve solutions
- Y414.3 Numerical methods: solution of equations
- Y414/Ne1 Graphs of root-finding methods
- Y414/Ne2 Solving equations to required accuracy
- Y414/Ne3 Merits and failures of root-finding methods
- Y414/Ne4 Order of convergence of iterations
- Y414/Ne5 Relaxation of fixed point iteration
- Y414.4 Numerical methods: numerical differentiation
- Y414/Nc1 Forward and central difference estimates
- Y414/Nc2 Accuracy of central differences
- Y414.5 Numerical methods: numerical integration
- Y414/Nc3 Numerical integration to required accuracy
- Y414/Nc4 Order of midpoint, trapezium and Simpson's rules
- Y414.6 Numerical methods: approximations to functions
- Y414/Nf1 Newton's forward difference interpolation
- Y414/Nf2 Interpolating polynomials