Register

ISRO2017-76

• reopened by
4,443 views
5 votes
5 votes

Which of the following algorithms solves the all pair shortest path problem?

  1. Prim's algorithm
  2. Dijkstra's algorithm
  3. Bellman ford algorithm
  4. Floyd warshalls algorithm
• reopened by
User Avatar

3 Answers

Best answer
8 votes
8 votes
Option D will be correct...

Floyd warshalls algorithm is based on dynamic paradigm approach which is used to solve All pair shortest path problem..
• selected by
User Avatar
5 votes
5 votes
  1. Prim's algorithm-------> spanning Tree
  2. Dijkstra's algorithm------> single source shortest path
  3. Bellman ford algorithm-------> single source shortest path
  4. Floyd warshalls algorithm----->all pair shortest path

so ans: D

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

10 votes
10 votes
8 answers
1
Arjun asked May 9, 2017
13,228 views
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Which of the following data structure is useful in traversing a given graph by breadth first search?StackQueueListNone of the above
User Avatar
14 votes
14 votes
3 answers
2
sh!va asked May 7, 2017
4,269 views
ISRO2017-80
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\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to bea. $O(n\log n)$b. $O\left( n^{3/2}\right)$c. $O( n^3 )...
User Avatar
9 votes
9 votes
5 answers
3
sh!va asked May 7, 2017
8,030 views
ISRO2017-49
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is $11$ $12$ $13$ $10$
The number of swappings needed to sort the numbers $8 , 22, 7, 9, 31, 5, 13$ in ascending order using bubble sort is$11$$12$$13$$10$
User Avatar
10 votes
10 votes
5 answers
4
sh!va asked May 7, 2017
4,928 views
ISRO2017-15
Which one of the following in-place sorting algorithms needs the minimum number of swaps? Insertion Sort Quick Sort Heap Sort Selection Sort
Which one of the following in-place sorting algorithms needs the minimum number of swaps?Insertion SortQuick SortHeap SortSelection Sort
User Avatar
Link Copied!