In CBSE and competitive exams, “Relations and Functions” is a foundational chapter that builds key skills for understanding injective/surjective/bijective mappings, inverse functions, and function compositions. Many conceptual problems also appear in JEE/NEET and board exams in the form of checking injectivity/surjectivity, finding inverses, and using functional equations—so strong clarity here directly improves scoring accuracy.
15
Minutes
10
Questions
1 / -0
Marking
Q1. Let be defined by . Which of the following is true about ?
is one-one but not onto.
is bijective.
is onto but not one-one.
is neither injective nor surjective.
Q2. Let be defined by . Then which of the following is correct?
is injective but not surjective; its range is .
is surjective but not injective; its range is .
is bijective and for .
is bijective;
Q3. Let be defined by , where . For which real values of is injective?
only
all
all real
no real value of
Q4. Assertion (A): Let satisfy for all . Then every element of is a fixed point of , i.e. for every we have .
Reason (R): If then there exists with . Hence .
(opt1) Both (A) and (R) are true but (R) does not correctly explain (A).
Both (A) and (R) are true but (R) does not correctly explain (A).
(A) is true and (R) is false.
Both (A) and (R) are true and (R) correctly explains (A).
(A) is false but (R) is true.
Q5. Let be defined by
Which of the following statements is correct?
is injective but not surjective.
is bijective;
is surjective but not injective.
is neither injective nor surjective.
Q6. Let be defined by . Then
Q7. Let be defined by . The number of real in the domain such that is
Q8. Let be defined by . The inverse is given by
Q9. Consider functions and .
Assertion (A): If is bijective then both and are bijective.
Reason (R): If is bijective then is injective and is surjective.
Both (A) and (R) are true and (R) is a correct explanation of (A)
(A) is false and (R) is true
Both (A) and (R) are true but (R) is not a correct explanation of (A)
(A) is true and (R) is false
Q10. Let . For define by . The number of ordered pairs for which is a bijection is