Lakshya NDA

Paper I — Mathematics

Sets, Relations and Functions

Exam-focused notes, visual explanation, traps, revision sheet and every mapped past NDA question.

Your study controls

Log in to mark complete, bookmark and save mastery.

Log in to track progress
Core5 mapped NDA questions

Build the idea

Build exam-ready understanding by connecting the core idea, formulas or facts, worked example and previous NDA questions. Focus on why each rule works, then test it under timed conditions.

Concept

A set is a well-defined collection of distinct objects. Operations on sets (union ∪, intersection ∩, difference, complement) are visualised with Venn diagrams. A relation from set A to B is a subset of the Cartesian product A×B; a function is a special relation in which every element of A has exactly one image in B.

Key relation types are reflexive, symmetric, transitive; a relation that is all three is an equivalence relation.

Key Points & Formulas

  • n(A∪B) = n(A) + n(B) − n(A∩B); for three sets add back n(A∩B∩C).
  • De Morgan's laws: (A∪B)' = A'∩B' and (A∩B)' = A'∪B'.
  • Cartesian product: if n(A)=m, n(B)=n, then n(A×B)=mn.
  • A set with n elements has 2ⁿ subsets and 2ⁿ−1 proper subsets.
  • Functions: one-one (injective), onto (surjective), bijective (both). Only bijective functions have an inverse.

Worked Example

Q. In a survey of 120 people, 70 read newspaper A, 55 read B and 25 read both. How many read at least one newspaper?

Use n(A∪B) = n(A)+n(B)−n(A∩B).

= 70 + 55 − 25 = 100.

So 100 people read at least one (and 120−100 = 20 read neither).

Common traps

  • Reading the prompt too quickly and missing a qualifier.
  • Memorising the result without checking when it applies.
  • Skipping units, signs, chronology or the final reasonableness check.

NDA shortcuts

  • State the governing rule before substituting values.
  • Eliminate impossible options before doing full calculation.

One-screen revision sheet

Recall before you practise

  • Core definition
  • Most-used rule
  • One representative example

Past-paper bank

Practise every mapped question

5 NDA questions

Choose an answer before the solution appears. Option order is mixed automatically.

Question 1

NDA I 2026

Consider the following statements in respect of the events AA, BB, CC:
I. (A∪B∪C)∩(Aˉ∩Bˉ∩Cˉ)\footnotesize (A \cup B \cup C) \cap (\bar{A} \cap \bar{B} \cap \bar{C}) is an impossible event.
II. (A∩B∩C)∩(Aˉ∪Bˉ∪Cˉ)\footnotesize (A \cap B \cap C) \cap (\bar{A} \cup \bar{B} \cup \bar{C}) is a possible event.
Which of the statements given above is/are correct?

Question 2

NDA II 2025

What is f(x)f(x+1)\dfrac{f(x)}{f(x+1)} equal to?

Question 3

NDA II 2024

If f(x)=4x+1f(x) = 4x + 1 and g(x)=kx+2g(x) = kx + 2 such that f∘g(x)=g∘f(x)f \circ g(x) = g \circ f(x), then what is the value of kk?

Question 4

NDA II 2024

Which one of the following is g(x)g(x)?

Question 5

NDA II 2024

Let P and Q be two non-void relations on a set A. Which of the following statements are correct? I. If P and Q are reflexive ⇒ P ∩ Q is reflexive. II. If P and Q are symmetric ⇒ P ∪ Q is symmetric. III. If P and Q are transitive ⇒ P ∩ Q is transitive.

Select the correct answer using the code given below.