We are given the relation R={(f,g):f(0)=g(1) and f(1)=g(0)} on the set of all functions f:Z→Z.
Reflexive: For (f,f)∈R, we need f(0)=f(1) and f(1)=f(0). Both conditions reduce to f(0)=f(1). This is not true for all functions (e.g., f(x)=x gives f(0)=0=1=f(1)). So R is not reflexive.
Symmetric: If (f,g)∈R, then f(0)=g(1) and f(1)=g(0). For (g,f)∈R, we need g(0)=f(1) and g(1)=f(0). The first condition follows from f(1)=g(0), and the second from f(0)=g(1). So R is symmetric.
Transitive: Suppose (f,g)∈R and (g,h)∈R. Then f(0)=g(1), f(1)=g(0), g(0)=h(1), g(1)=h(0). For (f,h)∈R, we need f(0)=h(1) and f(1)=h(0). We have f(0)=g(1)=h(0) and f(1)=g(0)=h(1). So we need f(0)=h(1) which means h(0)=h(1), and f(1)=h(0) which means h(1)=h(0). This need not hold in general. For example, let f(0)=1,f(1)=0, g(0)=0,g(1)=1, h(0)=1,h(1)=0. Then (f,g)∈R and (g,h)∈R, but f(0)=1 and h(1)=0, so f(0)=h(1), meaning (f,h)∈/R. So R is not transitive.
Therefore R is symmetric but neither reflexive nor transitive.
Hence, the correct answer is Option B.