GATE CS 2023 Set 1 — Question 49

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MSQ+2 / -0MediumSets, Relations & FunctionsSets & CombinatoricsEngineering Mathematics

Engineering Mathematics → Sets & Combinatorics → Sets, Relations & Functions

Last updated

Question

Let f:ABf : A \to B be an onto (or surjective) function, where AA and BB are nonempty sets. Define an equivalence relation \sim on the set AA asa1a2 if f(a1)=f(a2),a_1 \sim a_2 \text{ if } f(a_1) = f(a_2),where a1,a2Aa_1, a_2 \in A. Let E={[x]:xA}\mathcal{E} = \{[x] : x \in A\} be the set of all the equivalence classes under \sim. Define a new mapping F:EBF : \mathcal{E} \to B asF([x])=f(x), for all the equivalence classes [x] in E.F([x]) = f(x), \text{ for all the equivalence classes } [x] \text{ in } \mathcal{E}.Which of the following statements is/are TRUE?
Your answer

Select all that apply, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Sets & Combinatorics