Let $A$ be the set of all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ and $R$ be a relation on $A$ such that $R =\{( f , g ): f(0)= g (1) \text{ and } f(1)= g (0)\}$. Then $R$ is:

  • A
    Symmetric and transitive but not reflexive
  • B
    Symmetric but neither reflexive nor transitive
  • C
    Reflexive but neither symmetric nor transitive
  • D
    Transitive but neither reflexive nor symmetric

Explore More

Similar Questions

$x^2 = xy$ is a relation which is

Determine whether the following relation is reflexive,symmetric,and transitive:
Relation $R$ in the set $A$ of human beings in a town at a particular time is given by:
$R = \{(x, y) : x \text{ and } y \text{ live in the same locality}\}$

Let $A = \{-2, -1, 0, 1, 2, 3, 4\}$. Let $R$ be a relation on $A$ defined by $xRy$ if and only if $2x + y \le 2$. Let $l$ be the number of elements in $R$. Let $m$ and $n$ be the minimum number of elements required to be added in $R$ to make it reflexive and symmetric relations respectively. Then $l + m + n$ is equal to:

$A$ relation $R$ defined on the set $A = \{a, b, c\}$ is given by $R = \{(a, a), (b, b), (c, c), (a, c)\}$. This relation is . . . . . . .

Give an example of a relation that is symmetric and transitive but not reflexive.

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo