A relation on a set is a subset of . For with elements there are relations.
Reflexive: for every.
Symmetric: .
Transitive: .
Equivalence: all three. Empty relation: symmetric and transitive (vacuously), not reflexive on a non-empty set. Universal relation : equivalence.
2. Equivalence classes
. Two classes are either identical or disjoint, and together they cover (a partition). Example: “ divisible by ” on has classes (remainders ).
3. Functions
One-one (injective): . Test: solve ; or find two different inputs with the same output to disprove. A strictly increasing/decreasing function is one-one.
Onto (surjective): range codomain. Test: for arbitrary in the codomain, solve and check that lies in the domain.
Bijective: one-one and onto.
Counting (, ): functions ; one-one functions if , else ; onto functions from a -set to a -set: .
Worked example 1
On , : classes .
Worked example 2
, : (one-one); for any , works (onto). Bijective.
Worked example 3
, : one-one (as ), not onto ( and have no pre-image).
Common errors
Checking reflexivity for only the elements that appear in instead of all of .
Showing onto by solving for but not checking that lies in the domain (e.g. , ).
Forgetting that the answer depends on the domain and codomain: is not one-one on but is one-one on .
Giving an “example” instead of a proof when asked to show a property holds; a single counter-example is enough only to show it fails.
Board-exam tips
Write each of reflexive, symmetric, transitive under its own heading with a one-line reason.
For a “not” answer, always give a specific counter-example pair.
Composite and inverse functions are not in the current syllabus — do not spend time on or .
Topics in this chapter: Types of relations · Counting relations and functions · Equivalence relations and equivalence classes · One-one and onto functions.
Relations and Functions Class 12: important questions
10 original questions in the board paper's question types, from 1-mark MCQs to a case study, each with a step-marked worked answer. Try each one first. 5 worked answers open here; the other 5 open with a free account (no card).
Section A style · Multiple choice and assertion–reason (1 mark each)
Q1·1 mark·Multiple choiceTypes of relations
Which statement is true of the relation on the set ?
Show worked answer
All four pairs are in (reflexive); but (not symmetric); every chain such as gives a pair already in (transitive) A1
Correct option: (a) It is reflexive and transitive but not symmetric.
Q2·1 mark·Multiple choiceOne-one and onto functions
Which describes as a function from to ?
Q3·1 mark·Assertion–reasonOne-one and onto functions
In the following question, a statement of Assertion (A) is followed by a statement of Reason (R). Choose the correct option.
Assertion (A): The function , , is one-one.
Reason (R): The function , , is not onto.
Section B style · Short answer (2 marks each)
Q4·2 marks·Short answerEquivalence relations
On the set of integers , . Show that is reflexive and symmetric.
Show worked answer
Answer: Shown
Reflexive: , so for every integer A1
Symmetric: if , then , so A1
Q5·2 marks·Short answerOne-one and onto functions
Show that , , is one-one.
Section C style · Short answer (3 marks each)
Q6·3 marks·Short answerTypes of relations
On , . Determine whether is reflexive, symmetric and transitive.
Show worked answer
Answer: Symmetric only
Not reflexive: needs , which no satisfies (e.g. ) A1
Symmetric: A1
Not transitive: and , but A1
Q7·3 marks·Short answerOne-one and onto functions
Prove that the function , from to , is a bijection.
Section D style · Long answer (5 marks each)
Q8·5 marks·Long answerEquivalence relations
On , . Show that is an equivalence relation. Write the equivalence class and state how many equivalence classes there are.
Show worked answer
Answer: Equivalence relation; ; classes
Reflexive: is divisible by B1
Symmetric: B1
Transitive: and M1 , so : is an equivalence relation A1 ; there are classes (remainders , , on division by ) A1
Q9·5 marks·Long answerOne-one and onto functions
(a) Show that , , is one-one and onto. (b) Show that , , is neither one-one nor onto.
Section E style · Case study (4 marks)
Q10·4 marks·Case studyOne-one and onto functions
Cinema seats. Five friends (Asha, Bina, Chetan, Dev and Esha) form the set , and the six seats of a row form the set . Each friend gets a different seat, so the seating is a one-one function .
Can be onto? Give a reason. [1 mark]
How many one-one functions from to are there? [1 mark]
If the row had only five seats, how many one-one functions would there be, and would each be onto? [2 marks]
Show worked answer
No: friends can fill at most of the seats, so one seat has no pre-image A1
A1
one-one functions M1
Each fills all five seats, so each is also onto (a bijection) A1
Work through the steps in order. Take each checkpoint closed book, about 1.5 minutes per mark; pass at 80% to move on. Two misses in a row means going back one step.
Step 1
Secure the basics
You can test a relation for reflexive, symmetric and transitive and tell whether a function is one-one or onto.
Original questions in the board's styles. Multiple-choice answers are checked as you go; for written answers, compare your working with the step mark scheme and record your marks. 3 of the 42 are competency-based (case studies and questions set in a real-life situation): the "Competency-based" button shows just those.
Q1·1 mark·Assertion–reasonTypes of relations
In the following question, a statement of Assertion (A) is followed by a statement of Reason (R). Choose the correct option.
Assertion (A): The relation on is symmetric.
Reason (R): For all natural numbers , .
(a)Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
(b)Both Assertion (A) and Reason (R) are true but Reason (R) is not the correct explanation of Assertion (A).
(c)Assertion (A) is true but Reason (R) is false.
(d)Assertion (A) is false but Reason (R) is true.
Q2·2 marks·Very short answerTypes of relations
Five seats in a row are numbered to . On define if seats and are the same seat or next to each other, i.e. . Determine whether is reflexive, symmetric or transitive.
Q3·2 marks·Very short answerEquivalence relations and equivalence classes
On , . Show that is an equivalence relation and write the equivalence class of .
Worked solution·2 marks·Very short answerOne-one and onto functions
For , , find the value of for which is onto.
Full worked solution Free, no sign-in
, defined for all (and then ) M1 is never attained, so A1
Every question here has a full worked solution.See them all →
Checking reflexivity only for elements that appear in R. Fix: check (a, a) for every a in the set A and say so.
Proving onto by solving for x without checking that x lies in the domain. Fix: after x = (4 − y)/3, write 'x ∈ ℝ for every y ∈ ℝ' (or check x ∈ ℕ, x ≠ 2, as needed).
Showing a property holds with an example instead of a proof. Fix: use general a, b, c for 'holds'; use one specific counter-example pair only for 'does not hold'.
Forgetting that one-one and onto depend on the domain and codomain. Fix: copy the domain and codomain into your first line and use them.
Transitive proofs that skip the algebra linking the two conditions. Fix: write 'aRb and bRc ⇒ … ⇒ aRc' with the working on each arrow.
Spending time on composition or inverse of functions. Fix: they are out of the current syllabus; focus on types of relations, equivalence classes and one-one/onto.
Want it against the clock? Take a timed 30-mark chapter test on Relations and Functions, new questions each time, or climb the Difficulty ladder, levels 1 to 10, three questions a level (CBSE Pro or the free trial).
What is in CBSE Class 12 Maths Chapter 1, Relations and Functions?
The topics are: Types of relations, Counting relations and functions, Equivalence relations and equivalence classes, One-one and onto functions. This page has revision notes for each, and 42 board-style practice questions with step-marked solutions.
How many marks is Relations and Functions worth?
It is in the Relations and Functions unit, which carries 8 of the 80 theory marks. CBSE gives marks by unit, not by chapter.
Where do students lose marks in Relations and Functions?
Checking reflexivity only for elements that appear in R. Fix: check (a, a) for every a in the set A and say so. Proving onto by solving for x without checking that x lies in the domain. Fix: after x = (4 − y)/3, write 'x ∈ ℝ for every y ∈ ℝ' (or check x ∈ ℕ, x ≠ 2, as needed).
Are the Relations and Functions important questions free?
Yes. The 10 important questions on this page are free to try, from 1-mark MCQs to a case study. 5 worked answers are open on the page; the others open with a free account (no card).
Are these NCERT questions?
No. Every practice question here is original, written in the board's question styles with step marks. For the textbook itself, use the NCERT link on this page.
Work through the Route to 95 with your progress saved
Save your answers and track your progressA free account remembers the questions you have done and brings you back to this page.