ISRO Scientist or Engineer Computer Science May 2017 Question 80

Question 80

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

Create a FREE account and get:

Download Maths Shortcuts PDF
Get 300+ previous papers with solutions PDF
500+ Online Tests for Free

Comments

Register with

OR

CAT Quant Questions | CAT Quantitative Ability

CAT Linear Equations

CAT Inequalities

CAT Quadratic Equations

CAT Averages, Ratios & Proportions

CAT Profit & Loss

CAT Number Systems

CAT Time, Distance & Work

CAT Progressions & Series

CAT Probability Combinatorics

CAT Venn Diagrams

CAT Data Sufficiency

CAT Logarithms, Surds & Indices

CAT Functions, Graphs & Statistics

CAT Miscellaneous

CAT DILR Questions | LRDI Questions For CAT

CAT Data Interpretation

CAT DI Data Change Over Period

CAT Tables With Missing Values

CAT DI Venn Diagrams

CAT DI Special Charts

CAT DI Maxima & Minima

CAT Quant-Based DI

CAT DI Connected Sets

CAT DI Miscellaneous

CAT LR Arrangement

CAT LR Selections With Conditions

CAT LR Coins & Weights

CAT LR Truth & Lie

CAT LR Scheduling

CAT LR Games & Tournaments

CAT 2D & 3-D LR

CAT Quant-Based LR

CAT LR Miscellaneous

CAT Verbal Ability Questions | VARC Questions For CAT

CAT Reading Comprehension (RC)

CAT Para Jumbles

CAT Para Completion and Summary Questions

CAT Grammar & Sentence Correction

CAT Critical Reasoning

Boost your Prep!

Download App