Computer Sciences > GATE 2021 SET-1 > Relations
A relation R is said to be circular if aRb and bRc together imply cRa.
Which of the following options is/are correct?
A
If a relation S is reflexive and symmetric, then S is an equivalence relation.
B
If a relation S is circular and symmetric, then S is an equivalence relation.
C
If a relation S is reflexive and circular, then S is an equivalence relation.
D
If a relation S is transitive and circular, then S is an equivalence relation.

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science