Sets Relations Functions Class 11 Questions for AGNIVEER NAVY

Sets — Basics and Operations

A set is a well-defined collection of distinct objects. In Agniveer exams, you need to recognize set notation, perform union/intersection/complement operations, and count elements using Venn diagrams. Sets are either finite (countable elements) or infinite (like natural numbers). Roster form lists elements explicitly; set-builder form uses a condition. Key operations: Union (A ∪ B) combines all elements; Intersection (A ∩ B) keeps only common elements; Complement (A') includes elements NOT in A.

• Roster form: {1, 2, 3}; Set-builder form: {x | x is a natural number < 4}
• Union A ∪ B: all elements from A or B or both
• Intersection A ∩ B: only elements in both A and B
• Complement A': all elements in universal set U except A
• De Morgan's Laws: (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B'
• Cardinality |A| = number of elements in set A

Relations — Definition and Types

A relation from set A to set B is any subset of the Cartesian product A × B. If A = {1, 2} and B = {a, b}, then A × B = {(1,a), (1,b), (2,a), (2,b)}. A relation R ⊆ A × B can have special properties: Reflexive (every element relates to itself), Symmetric (if x relates to y, then y relates to x), Transitive (if x relates to y and y relates to z, then x relates to z). An Equivalence Relation satisfies all three properties. Agniveer exams test your ability to identify these properties from given relations.

• Reflexive: (a, a) ∈ R for all a ∈ A (example: 'equal to' relation)
• Symmetric: if (a, b) ∈ R then (b, a) ∈ R (example: 'is sibling of')
• Transitive: if (a, b) ∈ R and (b, c) ∈ R then (a, c) ∈ R (example: 'less than')
• Equivalence Relation: reflexive + symmetric + transitive (example: 'congruent modulo n')
• Number of relations from A to B: 2^(|A| × |B|) because each ordered pair can be included or excluded

Functions — Definition, Types, and Properties

A function f: A → B is a special relation where each element of A maps to exactly one element of B. A is the domain, B is the codomain. The range is the set of all outputs actually achieved. Three critical types: (1) One-One (Injective): different inputs give different outputs — no two elements of A map to same element of B. (2) Onto (Surjective): every element of B is mapped to by at least one element of A — range = codomain. (3) Bijective: both one-one and onto — creates perfect pairing, inverse function exists. Agniveer tests all three types heavily.

• One-One (Injective): f(a1) = f(a2) implies a1 = a2; graphically, horizontal line cuts graph at most once
• Onto (Surjective): for every b in B, there exists a in A such that f(a) = b; range = codomain
• Bijective: one-one AND onto; inverse function f^(-1) exists; used in permutations
• Composition f ∘ g means apply g first, then f: (f ∘ g)(x) = f(g(x))
• Identity function f(x) = x; constant function f(x) = c for all x

Venn Diagrams and Practical Problem Solving

Venn diagrams visually represent sets and their relationships. Circles represent sets; overlapping regions show intersections; area outside all circles shows complement. In Agniveer exams, you'll see 2-3 set Venn diagrams with shaded regions and must identify which operation (union, intersection, complement, symmetric difference) is shown. Symmetric difference A Δ B = (A ∪ B) - (A ∩ B) = elements in A or B but not both. Always label regions clearly and count systematically.

• Symmetric Difference A Δ B: elements in exactly one of A or B, not in both
• Shaded region interpretation: identify which sets are included/excluded in each region
• Three-set Venn: 8 regions total (2^3); label center, pairwise intersections, single sets, outside
• Practical: use Venn to solve word problems about surveys, preferences, classifications

• Confusing codomain with range — codomain is given, range is what's actually achieved. A function can be onto only if range = codomain.
• Mixing up one-one and onto — one-one is about injectivity (no two inputs map to same output); onto is about surjectivity (every output is hit). A function can be one-one but not onto, or vice versa.
• Forgetting De Morgan's Laws — (A ∪ B)' = A' ∩ B' NOT A' ∪ B'. This is tested in complement questions.
• Counting relations incorrectly — total relations from A to B is 2^(|A| × |B|), not 2^|A| or 2^|B|. Each ordered pair is independent.
• Misinterpreting Venn diagram regions — always identify which sets each region belongs to before counting or shading.

• RIOT for Relation Properties: Reflexive (self-loop), Irreflexive (no self-loop), Symmetric (bidirectional), Transitive (chain rule). Equivalence = R + S + T.
• IOB for Function Types: Injective (one-to-one, I), Onto (surjective, O), Bijective (both, B). Remember: Bijective = I + O = Invertible.
• UIC for Set Operations: Union (Include all), Intersection (Include common), Complement (Include outside). De Morgan flips: (A ∪ B)' = A' ∩ B'.
• Venn Diagram Zones: For two sets A and B, four zones exist: only A, only B, both A and B, neither. For three sets, expand to 8 zones.

• Agniveer Navy SSR/MR typically has 1-2 MCQs on set operations (inclusion-exclusion), 1 on relation properties (identify reflexive/symmetric/transitive), 1-2 on function types (one-one/onto/bijective). Total ~4 questions, 4-5 marks.
• Venn diagram questions appear in 30-40% of papers — practice shading and region counting. These are quick if you label regions first.
• Function composition questions are less common but high-accuracy if you remember (f ∘ g)(x) = f(g(x)) and check domain restrictions.
• Word problems on surveys/classifications use inclusion-exclusion principle — always draw Venn diagram first, then apply formula. This saves time and reduces errors.
• Time management: Sets/Relations/Functions should take 4-5 minutes total per question. If stuck on identifying relation properties, eliminate options by testing reflexivity first (easiest to verify).