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

Gate CS-2005 Question Paper With Solutions

Answer: (D)

Explanation:

Gate CS-2005 Question Paper With Solutions

Learn More:   Gate CS-2018 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here