Skip to content
MathsCBSE Class 12 · Sample paper, session 2024-25 · 4 marks · Case-based

CBSE Class 12 Mathematics sample paper 2024-25: question 37

From the official CBSE sample question paper for 2024-25, section E, question 37, for 4 marks. Try it first; the hints and our step-by-step solution are below.

Q37 · 4 marks · Case-basedCompetency-basedRelations and Functions

An organization conducted bike race under 2 different categories-boys and girls. In all, there were 250 participants. Among all of them finally three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets and with these participants for his college project.
Let , where represents the set of boys selected and the set of girls who were selected for the final race.
Ravi decides to explore these sets for various types of relations and functions.
On the basis of the above information, answer the following questions:

  1. (i)

    Ravi wishes to form all the relations possible from to . How many such relations are possible?

    1 mark
  2. (ii)

    Write the smallest equivalence relation on G.

    1 mark
  3. (iii)

    (a) Ravi defines a relation from B to B as . Write the minimum ordered pairs to be added in so that it becomes (A) reflexive but not symmetric, (B) reflexive and symmetric but not transitive.

    2 marks
  4. OR

    (iii)

    (b) If the track of the final race (for the biker ) follows the curve ; (where & ), then state whether the track represents a one-one and onto function or not. (Justify).

    2 marks

Source: official sample paper from cbseacademic.nic.in (PDF). See it in the full Sample paper 2024-25.

Hints

Open one hint at a time and try again before the next.

Hint 1

A relation from to is just a subset of . Count the elements of first.

Hint 2

A reflexive relation on must contain every . To spoil symmetry or transitivity, add a pair that is missing its partner.

Hint 3

For on , use to prove one-one. For onto, solve for and check that stays in the domain.

Step-by-step solution

Each step shows the marks it earns, as an examiner would award them. Checked by an independent re-solve from the question paper.

  1. (i) A relation from to is any subset of . Here , so the number of relations is .

    1 mark
  2. (ii) An equivalence relation must at least be reflexive. So the smallest equivalence relation on is , which is also symmetric and transitive.

    1 mark
  3. (iii)(a)(A) For reflexivity, add . To break symmetry, add one pair such as without its reverse. So the minimum pairs to add are . Any one of may be used instead of .

    1 mark
  4. (iii)(a)(B) Add . The relation is now reflexive and symmetric. It is not transitive, because and but .

    1 mark
  5. (iii)(b) One-one: , . If , then , so . Since , this gives . So is one-one.

    1 mark
  6. (iii)(b) Onto: for any , take . Then and . Every has a pre-image, so is onto. Hence the track represents a one-one and onto function.

    1 mark

Answer: (i) ; (ii) ; (iii)(a) (A) add ; (B) add ; (iii)(b) Yes, it is one-one and onto

Where the marks are

  • (i) Gets relations (1 mark)
  • (ii) Writes (1 mark)
  • (iii)(a)(A) Adds the three diagonal pairs plus one non-symmetric pair (1 mark)
  • (iii)(a)(B) Adds the diagonal pairs plus (1 mark)
  • (iii)(b) Proves one-one using (1 mark)
  • (iii)(b) Proves onto using the pre-image (1 mark)

Revise the chapter

The question is transcribed from the official paper; figures are described in words. The solution, hints and chapter tag are ours. Spotted an error? Write tosupport@questionbuddy.in.