BITSAT Sets, Relations and Functions — practice questions
32 free MCQs with worked solutions. Tap any question for the answer + explanation, or practice them all in the app.
Practice BITSAT Sets, Relations and Functions in the app →A set is:Empty set has cardinality:Universal set:Function f: A → B is onto (surjective) if:Power set of {1, 2, 3} has:n(A ∪ B) =De Morgan's law: (A ∪ B)' =Cartesian product A × B has cardinality:A relation from A to B is:Domain of relation:Number of functions from A (|A| = n) to B (|B| = m):Identity function I: A → A is:Inverse of function f exists if and only if f is:Composition of functions (g ∘ f)(x) =If A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, find A ∩ B:Number of subsets of {1, 2, 3, 4, 5} with exactly 3 elements:For 3 sets A, B, C: n(A ∪ B ∪ C) =100 students; 50 like math, 60 like physics, 30 like both. Find students who like neither:Number of one-one functions from {1, 2, 3} to {a, b, c, d, e}:Equivalence relation requires:For sets A, B: A × B = B × A iff:Range of f(x) = sin(x) from R to R:|A| = 5, |B| = 3. Number of relations from A to B:For f: A → B and g: B → C, (g ∘ f)⁻¹ =Function f(x) = (x-1)/(x+2) on R - {-2}. f is bijection from R - {-2} to R - {?}:Equivalence classes of 'congruent mod 3' on Z:Number of one-one and onto (bijective) functions from {1,2,3} to {1,2,3}:For function f(x) = ax + b (a ≠ 0), inverse is:For f: R → R, f(x) = x³, f is:Distributive law: A ∩ (B ∪ C) =Inverse image f⁻¹(B) under f: X → Y for B ⊆ Y:Number of equivalence relations on set {a, b, c}: