Gate CS-2005 Question Paper With Solutions

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

Answer: (D)

Explanation: