Open In App

ISRO | ISRO CS 2018 | Question 77

Like Article
Like
Save
Share
Report

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

(A)

O(n)

(B)

O(n log n)

(C)

O(n 3/2)

(D)

O(n 3)


Answer: (D)

Explanation:

Refer: GATE-CS-2005 | Question 7 Option (D) is correct.


Quiz of this Question
Please comment below if you find anything wrong in the above post


Last Updated : 06 Jul, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads