ISRO Scientist/Engineer Question Paper Computer Science 2017
76. Question
Which of the following algorithm solves the all-pair shortest path problem?
Answer
77. Question
If L and P are two recursively enumerable languages, then they are not closed under
Answer
78. Question
In the context of modular software design, which one of the following combinations is desirable?
Answer
79. Question
The output of a lexical analyzer is
Answer
80. Question
The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be
Answer