Artham

Resource Material
For Session 2024-25

Best Notes
CBSECLASS 12 Maths

100% updated as per 2024-25 curriculum.

Quick Revision, tips, notes & mind maps.

Easily Understandable & effective language.

To the point Answers.

MATHEMATICS
Chapter 12: Linear Programming
 LINEAR PROGRAMMING
12
Mathematics

LINEAR PROGRAMMING

Top Concepts

1. Linear programming is the process of taking various linear inequalities relating to some
situation and finding the best value obtainable under those conditions.

2. Linear programming is part of a very important branch of mathematics called

‘Optimization Techniques’.

3. Problems which seek to maximise (or minimise) profit (or cost) form a general class of
problems called optimisation problems.

4. A problem which seeks to maximise or minimise a linear function, subject to certain

constraints as determined by a set of linear inequalities, is called an optimisation
problem.

5. A linear programming problem may be defined as the problem of maximising or

minimising a linear function subject to linear constraints. The constraints may be
equalities or inequalities.

6. Objective function: The linear function Z = ax + by, where a and b are constants and x and
y are decision variables, which has to be maximised or minimised is called a linear
objective function. An objective function represents cost, profit or some other quantity
to be maximised or minimised subject to constraints.

7. Linear inequalities or equations which are derived from the application problem are
problem constraints.

8. Linear inequalities or equations or restrictions on the variables of a linear programming

problem are called constraints.

9. The conditions x≥0 and y ≥ 0 are called non-negative restrictions. Non-negative

constraints are included because x and y are usually the number of items produced and
one cannot produce a negative number of items. The smallest number of items one could
produce is zero. These conditions are not (usually) stated; they are implied.

10. A linear programming problem is one which is concerned with finding the optimal value
(maximum or minimum value) of a linear function (called objective function) of several
variables (say x and y) subject to the conditions that the variables are non-negative and

(1)
 LINEAR PROGRAMMING
12

satisfy a set of linear inequalities (called linear constraints).

11. In linear programming, the term linear implies that all the mathematical relations used
in the problem are linear while programming refers to the method of determining a
particular program me or plan of action.

12. Forming a set of linear inequalities (constraints) for a given situation is called formulation
of the linear programming problem (LPP).

13. Mathematical formulation of linear programming problems

Step I: In every LPP, certain decisions are to be made. These decisions are represented by
decision variables. These decision variables are those quantities whose values are to be
determined. Identify the variables and denote them as x 1, x2, x3 …. or x, y and z etc.

Step II: Identify the objective function and express it as a linear function of the variables
introduced in Step I.

Step III: In a LPP, the objective function may be in the form of maximising profits or
minimising costs. Hence, identify the type of optimisation, i.e., maximisation or
minimisation.

Step IV: Identify the set of constraints stated in terms of decision variables and express
them as linear inequations or equations as the case may be.

Step V: Add the non-negativity restrictions on the decision variables, as in the physical
problems. Negative values of decision variables have no valid interpretation.

14. General LPP is of the form

Max (or min) Z = c1x1 + c2x2 + . . . + cnxn, where c1,c2, . . . cn are constants and x1, x2, ... xn
are called decision variables such that Ax ≤ (≥)B and xi ≥ 0.

15. A linear inequality in two variables represents a half plane geometrically. There are two
types of half planes:

(2)
 LINEAR PROGRAMMING
12

16. A set of values of the decision variables which satisfy the constraints of a linear
programming problem is called a solution of LPP.

17. The common region determined by all the constraints including non-negative constraints
x, y ≥ 0 of a linear programming problem is called the feasible region (or solution region)
for the problem. The region other than the feasible region is called the infeasible region.

18. Points within and on the boundary of the feasible region represent the feasible solution
of the constraints.

19. Any point in the feasible region which gives the optimal value (maximum or minimum)
of the objective function is called an optimal solution.

20. Any point outside the feasible region is called an infeasible solution.

21. A corner point of a feasible region is the intersection of two boundary lines.

22. A feasible region of a system of linear inequalities is said to be bounded if it can be

enclosed within a circle.

23. Corner Point Theorem 1: Let R be the feasible region (convex polygon) for a linear
programming problem and let Z = ax + by be the objective function. When Z has an
optimal value (maximum or minimum), where the variables x and y are subject to
constraints described by linear inequalities, the optimal value must occur at a corner

(3)
 LINEAR PROGRAMMING
12

point (vertex) of the feasible region.

24. Corner Point Theorem 2: Let R be the feasible region for a linear programming problem
and let Z = ax + by be the objective function. If R is bounded, then the objective function
Z has both a maximum and a minimum value on R and each of these occurs at a corner
point (vertex) of R.

25. If R is unbounded, then a maximum or a minimum value of the objective function may
not exist.

26. The graphical method for solving linear programming problems in two unknowns is as
follows:
A. Graph the feasible region.
B. Compute the coordinates of the corner points.
C. Substitute the coordinates of the corner points into the objective function to see
which gives the optimal value.
D. When the feasible region is bounded, M and m are the maximum and minimum
values of Z.
E. If the feasible region is not bounded, then this method can be misleading. Optimal
solutions always exist when the feasible region is bounded but may or may not exist
when the feasible region is unbounded.
i. M is the maximum value of Z if the open half plane determined by ax + by > M
has no point in common with the feasible region. Otherwise, Z has no maximum
value.
ii. Similarly, m is the minimum value of Z if the open half plane determined by ax +
by < m has no point in common with the feasible region. Otherwise, Z has no
minimum value.

27. Points within and on the boundary of the feasible region represent the feasible solutions
of the constraints.

28. If two corner points of the feasible region are both optimal solutions of the same type,
i.e., both produce the same maximum or minimum for the function, then any point on
the line segment joining these two points is also an optimal solution of the same type.

29. Types of Linear Programming Problems

i. Manufacturing problems: Problems dealing with the determination of the number

of units of different products to be produced and sold by a firm, when each product
requires fixed manpower, machine hours and labour hour per unit of product, in
order to make maximum profit.

(4)
 LINEAR PROGRAMMING
12

ii. Diet problems: Problems dealing with the determination of the amount of different
kinds of nutrients which should be included in a diet so as to minimise the cost of
the desired diet such that it contains a certain minimum amount of each
constituent/nutrient.

iii. Transportation problems: Problems dealing with the determination of the

transportation schedule for the cheapest way to transport a product from
plants/factories situated at different locations to different markets.

30. Advantages of LPP

i. The linear programming technique helps to make the best possible use of the
available productive resources (such as time, labour, machines etc.).

ii. A significant advantage of linear programming is highlighting of such bottle necks.

31. Disadvantages of LPP

i. Linear programming is applicable only to problems where the constraint and

objective functions are linear, i.e., where they can be expressed as equations which
represent straight lines.

ii. Factors such as uncertainty, weather conditions etc. are not taken into
consideration.

(5)
 LINEAR PROGRAMMING
12

(6)
 LINEAR PROGRAMMING
12

Important Questions
Multiple Choice questions-
1. The point which does not lie in the half plane 2x + 3y -12 < 0 is

(a) (1, 2)

(b) (2, 1)

(c) (2, 3)

(d) (-3, 2).

2. The corner points of the feasible region determined by the following system of linear
inequalities:

2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5).

Let Z = px + qy, where p, q > 0. Conditions on p and q so that the maximum of Z occurs
at both (3, 4) and (0, 5) is

(a) p = 3q

(b) p = 2q

(c) p = q

(d) q = 3p.

3. The corner points of the feasible region determined by the system of linear
constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let Z = px + qy, where p, q > 0. Condition
on p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20) is

(a) p = q

(b) p = 2q

(c) q = 2p

(d) q = 3p.

4. The feasible solution for a LPP is shown in the following figure. Let Z = 3x – 4y be the
objective function.

(7)
 LINEAR PROGRAMMING
12

Minimum of Z occurs at:

(a) (0, 0)

(b) (0, 8)

(c) (5, 0)

(d) (4, 10).

5. The corner points of the feasible region determined by the system of linear
constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let Z = px + qy, where p, q> 0. Condition
on p and q so that the maximum of Z occurs at both the points (15, 15) and (0, 20) is
Maximum of Z occurs at:

(a) (5, 0)

(b) (6, 5)

(c) (6, 8)

(d) (4, 10).

Very Short Questions:

1. Draw the graph of the following LPP:

5x + 2y ≤ 10, x ≥ 0,y ≥ 0.

2. Solve the system of linear inequations: x + 2y ≤ 10; 2x + y ≤ 8.

3. Find the linear constraints for which the shaded area in the figure below is the
solution set:

(8)
 LINEAR PROGRAMMING
12

4. A small firm manufactures neclaces and bracelets. The total number of neclaces and
bracelets that it can handle per day is at most 24. It takes one hour to make a bracelet
and half an hour to make a neclace. The maximum number of hours available per
day is 16. If the profit on a neclace is ₹100 and that on a bracelet is ₹300. Formulate
an LPP for finding how many of each should be produced daily to maximize the
profit?

It is being given that at least one of each must be produced. (C.B.S.E. 2017)

5. Old hens can be bought for? 2.00 each and young ones at? 5.00 each. The old hens
lay 3 eggs per week and the young hens lay 5 eggs per week, each egg being worth
30 paise. A hen costs ₹1.00 per week to feed. A man has only ₹80 to spend for hens.
Formulate the problem for maximum profit per week, assuming that he cannot
house more than 20 hens.

Long Questions:
1. Maximize Z-5x + 3y

subject to the constraints:

3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0,y ≥ 0. (N.C.E.R.T)

2. Minimize Z = 3x + 2y subject to the constraints:

x +y ≥ 8, 3x + 5y ≤ 15, x ≥ 0, y ≥ 0. (N.C.E.R.T.)

3. Determine graphically the minimum value of the objective function :

Z = – 50x + 20y

subject to the constraints:

2x-y ≥ – 5, 3x +y ≥ 3, 2x – 3y ≤ 12, x,y ≥ 0. (N.C.E.R.T.)

(9)
 LINEAR PROGRAMMING
12

Hence, find the shortest distance between the lines. (C.B.S.E. Sample Paper 2018-19)

2. Minimize and Maximize Z = 5x + 2y subject to the following constraints: x – 2y ≤ 2,

3x + 2y < 12, -3x + 2y ≤ 3, x ≥ 0, y ≥ 0. (A.I.C.B.S.E. 2015)

Assertion and Reason Questions:

1. Two statements are given-one labelled Assertion (A) and the other labelled Reason
(R). Select the correct answer to these questions from the codes(a), (b), (c) and (d) as
given below.

a) Both A and R are true and R is the correct explanation of A.

b) Both A and R are true but R is not the correct explanation of A.
c) A is true but R is false.
d) A is false and R is true.
e) Both A and R are false.

Consider the graph of 2x+3y≤12, 3x+2y≤12, x≥0, y≥0.

Assertion(A): (5, 1) is an infeasible solution of the problem.

Reason (R): Any point inside the feasible region is called an infeasible solution.

2. Two statements are given-one labelled Assertion (A) and the other labelled Reason
(R). Select the correct answer to these questions from the codes(a), (b), (c) and (d) as
given below.

a) Both A and R are true and R is the correct explanation of A.

b) Both A and R are true but R is not the correct explanation of A.
c) A is true but R is false.
d) A is false and R is true.
e) Both A and R are false.

Consider the graph of constraints

(10)
 LINEAR PROGRAMMING
12

5x + y ≤ 100, x + y ≤ 60, x, y ≥ 0

Assertion (A): The points (10, 50), (0, 60) and (20, 0) are feasible solutions.

Reason(R): Points within and on the boundary of the feasible region represents
infeasible solutions.

Case Study Questions:

1. Suppose a dealer in rural area wishes to purpose a number of sewing machines. He
has only ₹ 5760 to invest and has space for at most 20 items for storage. An electronic
sewing machine costs him ₹ 360 and a manually operated sewing machine ₹ 240. He can
sell an electronic sewing machine at a profit of ₹ 22 and a manually operated sewing
machine at a profit of ₹ 18.

Based on the above information, answer the following questions.

(i) Let x and y denotes the number of electronic sewing machines and manually
operated sewing machines purchased by the dealer. If it is assume that the dealer
purchased atleast one of the the given machines, then:

a. X+y≥0
b. X+y<0
c. X+y>0
d. X+y≤0

(ii) Let the constraints in the given problem is represented by the following
inequalities.

(11)
 LINEAR PROGRAMMING
12

Then which of the following point lie in its feasible region.

a. (0, 24)
b. (8, 12)
c. (20, 2)
d. None of these

(iii) If the objective function of the gi ven problem is maximise z = 22x + 18y, then
its optimal value occur at:

a. (0, 0)
b. (16, 0)
c. (8, 12)
d. (0, 20)

(iv) Suppose the following shaded region APDO, represent the feasible region
corresponding to mathematical formulation of given problem.

Then which of the following represent the coordinates of one of its corner points

a. (0, 24)
b. (12, 8)
(12)
 LINEAR PROGRAMMING
12

c. (8, 12)
d. (6, 14)

(v) If an LPP admits optimal solution at two consecutive vertices of a feasible region,
then:

a. The required optimal solution is at the midpoint of the tine joining two points.
b. The optimal solution occurs at every point on the tine joining these two
points.
c. The LPP under consideration is not solvable.
d. The LPP under consideration must be reconstructed.

2. Corner points of the feasible region for an LPP are (0, 3), (5, 0), (6, 8), (0, 8). Let Z = 4x
- 6y be the objective function.

Based on the above information, answer the following questions.

(i) The minimum value of Z occurs at:

a. (6, 8)
b. (5, 0)
c. (0, 3)
d. (0, 8)

(ii) Maximum value of Z occurs at:

a. (5, 0)
b. (0, 8)
c. (0, 3)
d. (6, 8)

(iii) Maximum of Z - Minimum of Z =

a. 58
b. 68
c. 78
d. 88

(iv) The corner points of the feasible region determined by the system of linear
inequalities are:

(13)
 LINEAR PROGRAMMING
12

a. (0, 0), (-3, 0), (3, 2). (2, 3)

b. (3, 0), (3, 2), (2, 3), (0, -3)
c. (0, 0), (3, 0), (3, 2), (2, 3), (0, 3)
d. None of these

(v) The feasible solution of LPP belongs to:

a. First and second quadrant.

b. First and third quadrant.
c. Only second quadrant.
d. Only first quadrant.

Answer Key-
Multiple Choice questions-
1. Answer: (c) (2, 3)

2. Answer: (d) q = 3p.

3. Answer: (d) q = 3p.

4. Answer: (b) (0, 8)

5. Answer: (a) (5, 0)

Very Short Answer:

1. Solution:

Draw the line AB: 5.v + 2y = 10 …(1),

(14)
 LINEAR PROGRAMMING
12

which meets x-axis at A (2, 0) and y-axis at B (0,5).

Also, x = 0 is y-axis and y = 0 is x-axis.

Hence, the graph of the given LPP is as shown (shaded):

2. Solution:

Draw the st. lines x + 2y = 10 and 2x + y = 8.

These lines meet at E (2,4).

Hence, the solution of the given linear inequations is shown as shaded in the following
figure :

3. Solution:

From the above shaded portion, the linear constraints are :

2x + y ≥ 2,x – y ≤ 1,

x + 2y ≤ 8, x ≥ 0, y ≥ 0.

(15)
 LINEAR PROGRAMMING
12

4. Solution:

Let ‘x’ neclaces and ‘y’ bracelets be manufactured per day.

Then LPP problem is:

Maximize Z = 100x+300y

Subject to the constraints : x + y ≤ 24,

1
(1) (x) + y ≤ l6,
2

i.e. 2x + y ≤ 32

and x ≥ 1

and y ≥ 1

i.e. x – 1 ≥ 0

and y – 1 ≥ 0.

5. Solution:

Let ‘x’ be the number of old hens and ‘y’ the number of young hens.
30
Profit = (3x + 5y) – (x + y) (1)
100

9𝑥 3
= + yx – y
10 2

𝑦 𝑥 5𝑦−𝑥
= − =
2 10 10

∴ LPP problem is:

5𝑦−𝑥
Maximize Z = subject to:
10

x ≥ 0,

y ≥ 0,

x + y ≤ 20 and

2x + 5y ≤ 80.

Long Answer:
1. Solution:
(16)
 LINEAR PROGRAMMING
12

The system of constraints is :

3x + 5y ≤ 15 …(1)

5x + 2y ≤ 10 …(2)

and x ≥ 0, y≥ 0 …(3)

The shaded region in the following figure is the feasible region determined by the
system of constraints (1) – (3):

It is observed that the feasible region OCEB is bounded. Thus we use Corner Point
Method to determine the maximum value of Z, where:

Z = 5x + 3y …(4)
20 45
The co-ordinates of O, C, E and B are (0, 0), (2,0), ( , ) (Solving 3x + 5y = 15 and
19 19
5x + 2y – 10) and (0, 3) respectively.

We evaluate Z at each comer point:

(17)
 LINEAR PROGRAMMING
12

2. Solution:

The system of constraints is :

x +y ≥ 8, , x ≥ 0, y ≥ 0…(1)

3x + 5y ≤ 15 …(2)

and x ≥ 0, y ≥ 0 …(3)

It is observed that there is no point, which satisfies all (1) – (3) simultaneously.

Thus there is no feasible region.

Hence, there is no feasible solution.

Solution:

The system of constraints is :

(18)
 LINEAR PROGRAMMING
12

2x-y ≥ – 5 …(1)

3x +y ≥ 3 …(2)

2x – 3y ≤ 12 …(3)

and x,y ≥ 0 …(4)

The shaded region in the following figure is the feasible region determined by the
system of constraints (1) – (4).

t is observed that the feasible region is unbounded.

We evaluate Z = – 50x + 20y at the corner points:

A (1, 0), B (6, 0), C (0, 5) and D (0, 3):

From the table, we observe that – 300 is the minimum value of Z.

But the feasible region is unbounded.

(19)
 LINEAR PROGRAMMING
12

∴ – 300 may or may not be the minimum value of Z. ”

For this, we draw the graph of the inequality.

– 50x + 20y < – 300

i.e. – 5x + 2y < – 30.

Since the remaining half-plane has common points with the feasible region,

∴ Z = – 50x + 20y has no minimum value.

3. Solution:

The given system of constraints is:

x – 2y ≤ 2 …(1)

3x + 2y < 12 …(2)

-3x + 2y ≤ 3 …(3)

and x ≥ 0, y ≥ 0.

The shaded region in the above figure is the feasible region determined by the
system of constraints (1) – (4). It is observed that the feasible region OAHGF is
bounded. Thus we use Corner Point Method to determine the maximum and
minimum value of Z, where

(20)
 LINEAR PROGRAMMING
12

Z = 5x + 2y …(5)

The co-ordinates of O, A, H, G and F are :

7 3 3 15 3
(0, 0). (2. 0), ( , ) and ( , , )
2 4 2 4 2

respectively. [Solving x

2y = 2 and 3x + 2y = 12 for

H and -3x + 2y = 3 and

3x + 2y = 12 for G]

We evaluate Z at each corner point:

Case Study Answers:

1. Answer :

(i) (c) x+y>0

(ii) (b) (8, 12)

Solution:

(21)
 LINEAR PROGRAMMING
12

Since (8, 12) satisfy all the inequalities, therefore (8, 12) is the point in its feasible
region.

(iii) (c) (8, 12)

Solution:

At (0, 0), z = 0

At (16, 0), z = 352

At (8, 12), z = 392

At (0, 20), z = 360

It can be observed that max z occur at (8, 12). Thus, z will attain its optimal value at
(8, 12).

(iv) (c) (8, 12)

Solution:

We have, x + y = 20 (i)

And 3x + 2y = 48 (ii)

On solving (i) and (ii), we get

x = 8, y = 12.

Thus, the coordinates of Pare (8, 12) and hence (8, 12) is one of its corner points.

(v) (b) The optimal solution occurs at every point on the tine joining these two points.

Solution:

The optimal solution occurs at every point on the line joining these two points.

2. Answer :
Construct the following table of values of objective function:
Corner Points Value of Z = 4x - 6y
(0, 3) 4 × 0 - 6 × 3 = -18
(5, 0) 4 × 5 - 6 × 0 = 20
(6, 8) 4 × 6 - 6 × 8 = -24

(22)
 LINEAR PROGRAMMING
12

(0, 8) 4 × 0 - 6 × 8 = -48

(i) (d) (0, 8)

Solution:

Minimum value of Z is -48 which occurs at (0, 8).

(ii) (a) (5, 0)

Solution:

Maximum value of Z is 20, which occurs at (5, 0).

(iii) (b) 68

Solution:

Maximum of Z - Minimum of Z = 20 - (-48) = 20 + 48 = 68

(iv) (c) (0, 0), (3, 0), (3, 2), (2, 3), (0, 3)

Solution:

The comer points of the feasible region are O(0, 0), A(3, 0), B(3, 2), C(2, 3), D(0, 3).

(v) (d) Only first quadrant.

Assertion and Reason Answers:

1. c) A is true but R is false.

2. c) A is true but R is false.

(23)
CLICK TO DOWNLOAD MORE CHAPTERS
Dear Teachers and Students,

Join School of Educators' exclusive WhatsApp, Telegram, and Signal groups for FREE access
to a vast range of educational resources designed to help you achieve 100/100 in exams!
Separate groups for teachers and students are available, packed with valuable content to
boost your performance.

Additionally, benefit from expert tips, practical advice, and study hacks designed to enhance
performance in both CBSE exams and competitive entrance tests.

Don’t miss out—join today and take the first step toward academic excellence!

Join the Teachers and Students

Group by Clicking the Link Below
JOIN OUR
WHATSAPP
GROUPS
FOR FREE EDUCATIONAL
RESOURCES
JOIN SCHOOL OF EDUCATORS WHATSAPP GROUPS
FOR FREE EDUCATIONAL RESOURCES
We are thrilled to introduce the School of Educators WhatsApp Group, a
platform designed exclusively for educators to enhance your teaching & Learning
experience and learning outcomes. Here are some of the key benefits you can
expect from joining our group:

BENEFITS OF SOE WHATSAPP GROUPS

Abundance of Content: Members gain access to an extensive repository of

educational materials tailored to their class level. This includes various formats such
as PDFs, Word files, PowerPoint presentations, lesson plans, worksheets, practical
tips, viva questions, reference books, smart content, curriculum details, syllabus,
marking schemes, exam patterns, and blueprints. This rich assortment of resources
enhances teaching and learning experiences.

Immediate Doubt Resolution: The group facilitates quick clarification of doubts.

Members can seek assistance by sending messages, and experts promptly respond
to queries. This real-time interaction fosters a supportive learning environment
where educators and students can exchange knowledge and address concerns
effectively.

Access to Previous Years' Question Papers and Topper Answers: The group
provides access to previous years' question papers (PYQ) and exemplary answer
scripts of toppers. This resource is invaluable for exam preparation, allowing
individuals to familiarize themselves with the exam format, gain insights into scoring
techniques, and enhance their performance in assessments.
 Free and Unlimited Resources: Members enjoy the benefit of accessing an array of
educational resources without any cost restrictions. Whether its study materials,
teaching aids, or assessment tools, the group offers an abundance of resources
tailored to individual needs. This accessibility ensures that educators and students
have ample support in their academic endeavors without financial constraints.

Instant Access to Educational Content: SOE WhatsApp groups are a platform where
teachers can access a wide range of educational content instantly. This includes study
materials, notes, sample papers, reference materials, and relevant links shared by
group members and moderators.

Timely Updates and Reminders: SOE WhatsApp groups serve as a source of timely
updates and reminders about important dates, exam schedules, syllabus changes, and
academic events. Teachers can stay informed and well-prepared for upcoming
assessments and activities.

Interactive Learning Environment: Teachers can engage in discussions, ask questions,

and seek clarifications within the group, creating an interactive learning environment.
This fosters collaboration, peer learning, and knowledge sharing among group
members, enhancing understanding and retention of concepts.

Access to Expert Guidance: SOE WhatsApp groups are moderated by subject matter
experts, teachers, or experienced educators can benefit from their guidance,
expertise, and insights on various academic topics, exam strategies, and study
techniques.

Join the School of Educators WhatsApp Group today and unlock a world of resources,
support, and collaboration to take your teaching to new heights. To join, simply click
on the group links provided below or send a message to +91-95208-77777 expressing
your interest.

Together, let's empower ourselves & Our Students and

inspire the next generation of learners.

Best Regards,
Team
School of Educators
 Join School of Educators WhatsApp Groups

You will get Pre- Board Papers PDF, Word file, PPT, Lesson Plan, Worksheet, practical
tips and Viva questions, reference books, smart content, curriculum, syllabus,
marking scheme, toppers answer scripts, revised exam pattern, revised syllabus,
Blue Print etc. here . Join Your Subject / Class WhatsApp Group.

Kindergarten to Class XII (For Teachers Only)

Class 1 Class 2 Class 3

Class 4 Class 5 Class 6

Class 7 Class 8 Class 9

Class 10 Class 11 (Science) Class 11 (Humanities)

Class 11 (Commerce) Class 12 (Science) Class 12 (Humanities)

Class 12 (Commerce) Kindergarten

Subject Wise Secondary and Senior Secondary Groups
(IX & X For Teachers Only)
Secondary Groups (IX & X)

SST Mathematics Science

English Hindi-A IT Code-402

Hindi-B Artificial Intelligence

Senior Secondary Groups (XI & XII For Teachers Only)

Physics Chemistry English

Mathematics Biology Accountancy

Economics BST History

 Geography Sociology Hindi Elective

Hindi Core Home Science Sanskrit

Psychology Political Science Painting

Vocal Music Comp. Science IP

Physical Education APP. Mathematics Legal Studies

Entrepreneurship French IT

Artificial Intelligence

Other Important Groups (For Teachers & Principal’s)

Principal’s Group Teachers Jobs IIT/NEET

 Join School of Educators WhatsApp Groups

You will get Pre- Board Papers PDF, Word file, PPT, Lesson Plan, Worksheet, practical
tips and Viva questions, reference books, smart content, curriculum, syllabus,
marking scheme, toppers answer scripts, revised exam pattern, revised syllabus,
Blue Print etc. here . Join Your Subject / Class WhatsApp Group.

Kindergarten to Class XII (For Students Only)

Class 1 Class 2 Class 3

Class 4 Class 5 Class 6

Class 7 Class 8 Class 9

Class 10 Class 11 (Science) Class 11 (Humanities)

Class 11 (Commerce) Class 12 (Science) Class 12 (Humanities)

Class 12 (Commerce) Artificial Intelligence

(VI TO VIII)
Subject Wise Secondary and Senior Secondary Groups
(IX & X For Students Only)
Secondary Groups (IX & X)

SST Mathematics Science

English Hindi IT Code

Artificial Intelligence

Senior Secondary Groups (XI & XII For Students Only)

Physics Chemistry English

Mathematics Biology Accountancy

Economics BST History

 Geography Sociology Hindi Elective

Hindi Core Home Science Sanskrit

Psychology Political Science Painting

Music Comp. Science IP

Physical Education APP. Mathematics Legal Studies

Entrepreneurship French IT

AI IIT/NEET CUET
Groups Rules & Regulations:
To maximize the benefits of these WhatsApp groups, follow these guidelines:

1. Share your valuable resources with the group.

2. Help your fellow educators by answering their queries.
3. Watch and engage with shared videos in the group.
4. Distribute WhatsApp group resources among your students.
5. Encourage your colleagues to join these groups.

Additional notes:
1. Avoid posting messages between 9 PM and 7 AM.
2. After sharing resources with students, consider deleting outdated data if necessary.
3. It's a NO Nuisance groups, single nuisance and you will be removed.
No introductions.
No greetings or wish messages.
No personal chats or messages.
No spam. Or voice calls
Share and seek learning resources only.

Please only share and request learning resources. For assistance,

contact the helpline via WhatsApp: +91-95208-77777.
 Join Premium WhatsApp Groups
Ultimate Educational Resources!!

Join our premium groups and just Rs. 1000 and gain access to all our exclusive
materials for the entire academic year. Whether you're a student in Class IX, X, XI, or
XII, or a teacher for these grades, Artham Resources provides the ultimate tools to
enhance learning. Pay now to delve into a world of premium educational content!

Click here for more details

Class 9 Class 10 Class 11

Class 12

📣 Don't Miss Out! Elevate your academic journey with top-notch study materials and secure
your path to top scores! Revolutionize your study routine and reach your academic goals with
our comprehensive resources. Join now and set yourself up for success! 📚🌟

Best Wishes,

Team
School of Educators & Artham Resources
 SKILL MODULES BEING OFFERED IN
MIDDLE SCHOOL

Artificial Intelligence Beauty & Wellness Design Thinking & Financial Literacy
Innovation

Handicrafts Information Technology Marketing/Commercial Mass Media - Being Media

Application Literate

Data Science (Class VIII Augmented Reality /

Travel & Tourism Coding
only) Virtual Reality

Digital Citizenship Life Cycle of Medicine & Things you should know What to do when Doctor
Vaccine about keeping Medicines is not around
at home

Humanity & Covid-19 Blue Pottery Pottery Block Printing

 Food Food Preservation Baking Herbal Heritage

Khadi Mask Making Mass Media Making of a Graphic

Novel

Kashmiri Embroidery Satellites

Rockets
Embroidery

Application of Photography
Satellites
SKILL SUBJECTS AT SECONDARY LEVEL (CLASSES IX – X)

Retail Information Technology Automotive

Security

Introduction To Financial Introduction To Tourism Beauty & Wellness Agriculture

Markets

Food Production Front Office Operations Banking & Insurance Marketing & Sales

Health Care Apparel Multi Media Multi Skill Foundation

Course

Artificial Intelligence
Physical Activity Trainer Electronics & Hardware
Data Science
(NEW)

Foundation Skills For Sciences Design Thinking & Innovation (NEW)

(Pharmaceutical & Biotechnology)(NEW)
 SKILL SUBJECTS AT SR. SEC. LEVEL
(CLASSES XI – XII)

Retail InformationTechnology Web Application Automotive

Financial Markets Management Tourism Beauty & Wellness Agriculture

Food Production Front Office Operations Banking Marketing

Health Care Insurance Horticulture Typography & Comp.

Application

Geospatial Technology Electrical Technology Electronic Technology Multi-Media

 Taxation Cost Accounting Office Procedures & Shorthand (English)
Practices

Shorthand (Hindi) Air-Conditioning & Medical Diagnostics Textile Design

Refrigeration

Salesmanship Business Food Nutrition &

Design
Administration Dietetics

Mass Media Studies Library & Information Fashion Studies Applied Mathematics
Science

Yoga Early Childhood Care & Artificial Intelligence Data Science

Education

Physical Activity Land Transportation Electronics & Design Thinking &

Trainer(new) Associate (NEW) Hardware (NEW) Innovation (NEW)
 Join School of Educators Signal Groups

You will get Pre- Board Papers PDF, Word file, PPT, Lesson Plan, Worksheet, practical
tips and Viva questions, reference books, smart content, curriculum, syllabus,
marking scheme, toppers answer scripts, revised exam pattern, revised syllabus,
Blue Print etc. here . Join Your Subject / Class signal Group.

Kindergarten to Class XII

Class 2 Class 3
Class 1

Class 5 Class 6
Class 4

Class 7 Class 8 Class 9

Class 10 Class 11 (Science) Class 11 (Humanities)

Class 11 (Commerce) Class 12 (Science) Class 12 (Humanities)

Class 12 (Commerce) Kindergarten Artifical intelligence

 Subject Wise Secondary and Senior Secondary
Groups IX & X

Secondary Groups (IX & X)

SST Mathematics Science

Hindi-B
English Hindi-A

IT Artifical intelligence
IT Code-402

Senior Secondary Groups XI & XII

Physics Chemistry English

Biology Accountancy
Mathematics

BST History
Economics
 Geography Sociology Hindi Elective

Hindi Core Home Science Sanskrit

Psychology Political Science Painting

IP
Vocal Music Comp. Science

Physical Education APP. Mathematics Legal Studies

IIT/NEET
Entrepreneurship French

Artifical intelligence CUET

 Join School of Educators CBSE Telegram Groups

Kindergarten

All classes Class 1 Class 2

Class 3 Class 4 Class 5

Class 6 Class 7 Class 8

Class 9 Class 10 Class 11 (Sci)

Class 11 (Com) Class 11 (Hum) Class 12 (Sci)

Class 12 (Com) Class 12 (Hum) JEE/NEET

CUET NDA, OLYMPIAD, NTSE Principal Professional Group

Teachers Professional Group Project File Group

Join School of Educators ICSE Telegram Groups

Kindergarten Class 1 Class 2

Class 3 Class 4 Class 5

Class 6 Class 7 Class 8

Class 9 Class 10 Class 11 (Sci)

Class 11 (Com) Class 11 (Hum) Class 12 (Sci)

Class 12 (Com) Class 12 (Hum)

Pdf Purchase
Print Purchase Scan QR Code to join
Telegram Groups &
Channels for more free
Amazon Print Purchase resources.