Courses
Tutorials
- DSA
- Data Structures
- Algorithms
- Interview Corner
- Languages
  - C
  - C++
  - Java
  - Python
  - JavaScript
  - PHP
  - C#
  - SQL
  - Scala
  - Perl
  - Go Language
  - Kotlin
- Web Development
  - HTML
  - CSS
  - JavaScript
  - PHP
  - CSS Frameworks
  - JavaScript Frameworks
  - JavaScript Libraries
  - WordPress
  - JSON
- School Learning
  - English Grammar
  - School Programming
  - Mathematics
  - Maths Notes (Class 8-12)
  - NCERT Solutions
  - RD Sharma Solutions
  - Physics Notes (Class 8-11)
  - Chemistry Notes
  - Business Studies (Class 11th)
  - Business Studies (Class 12th)
  - Accountancy (Class 12th)
  - Statistics for Economics (Class 11th)
- ML & Data Science
  - Machine Learning
  - Data Science
- CS Subjects
- GATE
- Software Designs
  - Software Design Patterns
  - System Design Tutorial
- GFG Sheets
  - Web Dev Cheat Sheets
  - Company-Wise SDE Sheets
  - DSA Sheets
- CS Exams/PSUs
  - ISRO
  - UGC NET
- Student
- UPSC
- SSC CGL
- Banking Exams
Jobs
Practice
Contests

ISRO | ISRO CS 2018 | Question 77

Difficulty Level : Medium
Last Updated : 06 Jul, 2018

Read

Discuss

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 ³)

Answer: (D)

Explanation: Refer: GATE-CS-2005 | Question 7