Register

UGC NET CSE | July 2018 | Part 2 | Question: 24

• recategorized
3,184 views

2 Answers

3 3 votes

Option D.

  1. Prim's algorithm = Min Cost spanning tree
  2. Floys-Warshall algorithm = All pair shortest path
  3. Johnson's algorithm =  All pair shortest path
  4. Dijkstra's algorithm = Single source shortest path

    Remember : 
    Bellman - Ford = Single source shortest path
Voting & Accepting an answer helps improve the community
← Previous · UGC NET CSE | July 2...Next → · UGC NET CSE | July 2...
← Previous in category · UGC NET CSE | July 2...Next in category → · UGC NET CSE | July 2...
Position:
Show:

Related questions

1 1 vote
3 3 answers
5.5k
5.5k views
Pooja Khatri asked Jul 13, 2018
5,492 views
UGC NET CSE | July 2018 | Part 2 | Question: 22
Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are ______ and _____ r...
0 0 votes
2 2 answers
10.0k
10.0k views
Pooja Khatri asked Jul 13, 2018
10,021 views
UGC NET CSE | July 2018 | Part 2 | Question: 23
A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the ...
0 0 votes
8 8 answers
6.4k
6.4k views
Pooja Khatri asked Jul 13, 2018
6,369 views
UGC NET CSE | July 2018 | Part 2 | Question: 26
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves:cannot have more than...
2 2 votes
3 3 answers
19.6k
19.6k views
Pooja Khatri asked Jul 13, 2018
19,648 views
UGC NET CSE | July 2018 | Part 2 | Question: 28
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):4572360450