Register

UGC NET CSE | December 2014 | Part 3 | Question: 34

• recategorized by
3,296 views
1 votes
1 votes

Dijkstra algorithm, which solves the single-source shortest--paths problem, is a _______, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a ________.

  1. Greedy algorithm, Divide-conquer algorithm
  2. Divide-conquer algorithm, Greedy algorithm
  3. Greedy algorithm, Dynamic programming algorithm
  4. Dynamic programming algorithm, Greedy algorithm 
• recategorized by
User Avatar

1 Answer

2 votes
2 votes

Dijkstra algorithm, which solves the single-source shortest--paths problem, is a Greedy algorithm, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a Dynamic programming algorithm.

C is ans.

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

Related questions

1 votes
1 votes
1 answer
2
makhdoom ghaya asked Jul 28, 2016
3,631 views
UGC NET CSE | December 2014 | Part 3 | Question: 33
We can show that the clique problem is $NP$-hard by proving that CLIQUE $\leq$ P 3-CNF_SAT CLIQUE $\leq$ P VERTEX_COVER CLIQUE $\leq$ P SUBSET_SUM None of the above
We can show that the clique problem is $NP$-hard by proving thatCLIQUE $\leq$ P 3-CNF_SATCLIQUE $\leq$ P VERTEX_COVERCLIQUE $\leq$ P SUBSET_SUMNone of the above
User Avatar
1 votes
1 votes
1 answer
3
makhdoom ghaya asked Jul 28, 2016
2,076 views
UGC NET CSE | December 2014 | Part 3 | Question: 32
Match the following $:$ ... $\text{a-iv, b-ii, c-iii, d-i}$ $\text{a-iii, b-ii, c-iv, d-i}$
Match the following $:$$\begin{array}{} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{Bucket sort} & \text{i.} & O(n^3\lg n) \\ \text{b.} & \text...
User Avatar
3 votes
3 votes
2 answers
4
makhdoom ghaya asked Jul 28, 2016
1,912 views
UGC NET CSE | December 2014 | Part 3 | Question: 31
Any decision tree that sorts $n$ elements has height $\Omega(n)$ $\Omega(\text{lg}n)$ $\Omega(n \text{lg} n)$ $\Omega(n^2)$
Any decision tree that sorts $n$ elements has height$\Omega(n)$$\Omega(\text{lg}n)$$\Omega(n \text{lg} n)$$\Omega(n^2)$
User Avatar
Link Copied!