Relations & Mappings Questions with Solutions
A relation from set A to set B is a subset of the Cartesian product A x B. A mapping, or function, is a special relation in which every element of A is related to exactly one element of B. This topic covers types of relations (reflexive, symmetric, transitive and equivalence relations), domain, codomain and range, and types of functions such as one-one (injective), onto (surjective) and bijective functions, along with composition and inverse functions. Exam questions test identifying the type of a given relation or function, counting the number of relations or functions between two sets, and finding the domain or range of a function. Useful counting facts: if A has m elements and B has n elements, there are 2^(mn) relations and n^m functions from A to B. Practise the relations and mappings questions below, each with a step-by-step solution.
- Q1.
and . Then is
A. One–oneB. OntoC. One–one and ontoD. None of thesehardAsked in MAH MCA CET 2023View solution › - Q2.
Define a relation on the set by if is divisible by 3. Then:
A. is not symmetric, not reflexive and not transitiveB. is reflexive but neither symmetric nor transitiveC. is symmetric but neither transitive nor reflexiveD. is transitive but neither reflexive nor symmetricmediumAsked in NIMCET 2026View solution › - Q3.
Let R be the set of real numbers. If is a function defined by . then is
A. Injective but not surjectiveB. Surjective but not injectiveC. BijectiveD. Neither injective nor surjectiveeasyAsked in MAH MCA CET 2024View solution › - Q4.
Let R be a reflexive relation on a finite set A having 10 elements, and let m be the number of ordered pairs in R. Then
A. B. C. D.easyAsked in NIMCET 2023View solution › - Q5.
The total number of relations that exist from a set with elements into the set is:
A. B. C. D. None of thesemediumAsked in NIMCET 2009View solution › - Q6.
Let . Let such that . Then the number of elements in is equal to
A. 10B. 13C. 7D. 17easyAsked in NIMCET 2025View solution ›