ISRO CSE 2017 PYQ ⋆ CSE Study247

ISRO CSE 2017 PYQ

Questions 76-80 of 80

0% completed (0/80 answered)

Question 76

MCQ · Single Correct 1 mark

Previous Year Question ISRO CSE 2017 PYQ

Which of the following algorithm solves the all-pair shortest path problem?

A Prim's algorithm B Dijikstra's algorithm C Bellman-Ford's algorithm D Floyd-Warshall's algorithm

MCQ · Single Correct 1 mark

Previous Year Question ISRO CSE 2017 PYQ

If L and P are two recursively enumerable languages, then they are not closed under

A Kleene Star L * of L B Intersection L ∩ P C Union L ∪ P D Set difference

MCQ · Single Correct 1 mark

Previous Year Question ISRO CSE 2017 PYQ

In the context of modular software design, which one of the following combinations is desirable?

A High cohesion and high coupling B High cohesion and low coupling C Low cohesion and high coupling D Low cohesion and low coupling

MCQ · Single Correct 1 mark

Previous Year Question ISRO CSE 2017 PYQ

The output of a lexical analyzer is

A A parse tree B Intermediate code C Machine code D A stream of tokens

MCQ · Single Correct 1 mark

Previous Year Question ISRO CSE 2017 PYQ

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 log n ) B O ( n ^ 3/2 ) C O ( n ^ 3 ) D O ( n )