Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE-CS-2005 | Question 7

  • Difficulty Level : Hard
  • Last Updated : 28 Jun, 2021
Geek Week

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

(A) O (n)
(B) O (n log n)
(C) O(n3/2)
(D) O(n3)


Answer: (D)

Explanation: See question 3 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-22/

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :