Relation

Q21.

The number of equivalence relations of the set {1,2,3,4} is
GateOverflow

Q22.

The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be
GateOverflow

Q23.

Let R_1 and R_1 be two equivalence relations on a set. Consider the following assertions: I. R_1 \cup R_2 is an equivalence relation II. R_1 \cap R_2 is an equivalence relation Which of the following is correct?
GateOverflow

Q24.

Let R be the relation on the set of positive integers such that aRb if and only if a and b are distinct and have a common divisor other than 1. Which one of the following statements about R is true?
GateOverflow

Q25.

A relation R is said to be circular if aRb and bRc together imply cRa. Which of the following options is/are correct?
GateOverflow