ISC Mathematics Class 12 Syllabus 2020-21

The syllabus is divided into three sections: A, B and C. Section A is compulsory for all candidates. You have a choice of attempting questions from either Section B or Section C. There is one paper of three hours duration of 100 marks.

Section A (80 marks) consists of nine questions. You are required to answer Question 1 (compulsory) and five out of the rest of the eight questions.

In Section B/C (20 marks), you are required to answer two questions out of three from either Section B or Section C.

SECTION A

1. Determinants and Matrices

(i) Determinants

Cramer's Rule

(ii) Matrices

Martin’s Rule

2. Boolean Algebra

Boolean algebra as an algebraic structure, principle of duality, Boolean function. Switching circuits, application of Boolean algebra to switching circuits.

3. Conics

As a section of a cone.

Definition of Foci, Directrix, Latus Rectum.

PS = ePL where P is a point on the conics, S is the focus, PL is the perpendicular distance of the point from the directrix.

(i) Parabola

(ii) Ellipse

(iii) Hyperbola

4. Inverse Trigonometric Function

5. Calculus

(i) Differential Calculus

(ii) Integral Calculus

6. Correlation and Regression

7. Probability

8. Complex Numbers

9. Differential Equations

SECTION B

10. Vectors

Proof of Formulae (Using Vectors)

11. Co-ordinate Geometry in 3-Dimensions

(i) Lines

(ii) Planes

12. Probability

Baye’s theorem; theoretical probability distribution, probability distribution function; binomial distribution - its mean and variance.

SECTION C

13. Discount

True discount; banker's discount; discounted value; present value; cash discount, bill of exchange. 

14. Annuities

Meaning, formulae for present value and amount; deferred annuity, applied problems on loans, sinking funds, scholarships. NOTE: Annuity due is required to be covered.

15. Linear Programming

Introduction, definition of related terminology such as constraints, objective function, optimization, isoprofit, isocost lines; advantages of linear programming; limitations of linear programming; application areas of linear programming; different types of linear programming (L.P.), problems, mathematical formulation of L.P problems, graphical method of solution for problems in two variables, feasible and infeasible regions, feasible and infeasible solutions, optimum feasible solution.

16. Application of derivatives in Commerce and Economics

Cost function, average cost, marginal cost, revenue function and break even point.

17. Index numbers and moving averages