The Gateway to Computer Science Excellence

0 votes

Let $X$ be the set $\{1, 2, 3, 4, 5\}$ and $Y$ be the set $\{6, 7, 8, 9, 10\}$. We describe the functions $f : X\rightarrow Y$ and $g : X\rightarrow Y$ in the following tables. Answer each part and give a reason for each negative answer.

$n$ | $f(n)$ |

1 | 6 |

2 | 7 |

3 | 6 |

4 | 7 |

5 | 6 |

$n$ | $g(n)$ |

1 | 10 |

2 | 9 |

3 | 8 |

4 | 7 |

5 | 6 |

- Is $f$ one-to-one?
- Is $f$ onto?
- Is $f$ a correspondence?
- Is $g$ one-to-one?
- Is $g$ onto?
- Is $g$ a correspondence?

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,644 questions

56,505 answers

195,555 comments

101,042 users