← Quiz: Closures and Warshall's Algorithm: all 10 questions
Quiz: Closures and Warshall's Algorithm · Question 9 of 10
Which relation is the smallest equivalence relation containing R?
Which relation is the smallest equivalence relation containing R?
- A.The transitive closure of R
- B.The symmetric closure of R
- C.The transitive closure of the reflexive and symmetric closure of R
- D.R ∪ R²
Answer & explanation
Correct answer: The transitive closure of the reflexive and symmetric closure of R
An equivalence relation needs all three properties, and closing under transitivity last keeps the other two.
Can you get the rest right without peeking?
Take the timed Quiz: Closures and Warshall's Algorithm quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →