Sets and Relations JEE Advanced previous year questions with solutions
3 solved JEE Advanced questions on Sets and Relations, free to read — no sign-in needed. The full chapter has 7 questions; sign in to attempt the remaining 4 in the exam simulator.
- Q1JEE Advanced Adv 2026 (Paper 1)Let . Consider the set is an equivalence relation on the set such that has exactly elements. Then the number of elements in is _____________.
Show answer & solution
Answer: 2520
An equivalence relation on a set corresponds to a partition of into disjoint equivalence classes. Let the sizes of these equivalence classes be . The number of elements in the equivalence relation is given by the sum of the squares of the sizes of its equivalence classes: Since the total number of elements in is , we also have: We need to find all possible partitions of such that the sum of their squares is . Let's check the possible sizes of the largest equivalence class, : Case 1: . The remaining sum of squares is , and the remaining sum of elements is . The only way to partition such that the sum of squares is is (since ). Thus, one valid partition is . Case 2: . The remaining sum of squares is , and the remaining sum of elements is . The only way to partition such that the sum of squares is is (since ). Thus, another valid partition is . Case 3: The maximum possible sum of squares would be for the partition , which gives . No other partitions can yield a sum of . Now, we calculate the number of ways to form these partitions from the elements of . For the partition : The number of ways to divide elements into groups of sizes is: (Note: We divide by because there are two groups of identical size ). For the partition : The number of ways to divide elements into groups of sizes is: Total number of equivalence relations in is: Answer: - Q2JEE Advanced Adv 2017 (Paper 2)Let . For let be the number of subsets of , each containing five elements out of which exactly are odd. Then
- A.
- B.
- C.
- D.
Show answer & solution
Answer: (D)
Total ways – {when no odd} Total ways Number of ways when no odd, is zero ( only available even are ) - Q3JEE Advanced Adv 2010 (Paper 2)Let . The total number of unordered pairs of disjoint subsets of is equal to
- A.25
- B.34
- C.42
- D.41
Show answer & solution
Answer: (D)
Let
4 more Sets and Relations questions are waiting
Attempt the full chapter in a real NTA CBT simulator with instant scoring, year-wise filters and detailed solutions.
Practise all 7 questionsSets and Relations in JEE Advanced: previous year question analysis
Sets and Relations has appeared 7 times in JEE Advanced between 2010 and 2026, making it the 80th most-asked of 93 chapters and about 0.3% of the bank. Over the last 5 years it has averaged 1.2 questions per year.
How many Sets and Relations questions appeared each year
| Year | Questions | Relative volume |
|---|---|---|
| 2010 | 1 | |
| 2017 | 1 | |
| 2022 | 1 | |
| 2024 | 2 | |
| 2025 | 1 | |
| 2026 | 1 |
Question formats used in Sets and Relations
- Numerical / integer answer5
- Single-correct MCQ2
How Sets and Relations compares with nearby chapters
- #78Electromagnetic Waves9
- #79Trigonometric Ratios & Identities9
- #80Sets and Relations7
- #81Basic of Mathematics6
- #82Chemical Equilibrium6
Counts are computed from AcadXL’s own JEE Advanced question bank, tagged chapter- and sub-topic-wise and checked against official answer keys. Sign in to attempt the 7 Sets and Relations questions with solutions.