recategorized
2,097 views
0 votes
0 votes

Dijkstra’s algorithm is based on

  1. Divide and conquer paradigm
  2. Dynamic programming
  3. Greedy approach
  4. Backtracking paradigm
recategorized

4 Answers

1 votes
1 votes
Dijkstra always chooses the closest vertex in V-S to add to set S where V= vertex set and S =set of vertices whose final shortest path weights from the source  have been obtained.

So Dijkstra's algorithm is a greedy algorithm.Hence answer is option 3.
edited by
0 votes
0 votes

Option C) Greedy Approach. On every iteration the vertex with the least distance after edge relaxation (best choice at that point of time i.e Greedy approach) is added to the list of mapped vertices

Answer:

Related questions

0 votes
0 votes
5 answers
1
go_editor asked Mar 24, 2020
3,473 views
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5 $ is...
0 votes
0 votes
6 answers
2
go_editor asked Mar 24, 2020
1,503 views
Match the following with respect to algorithm paradigms :$\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\ \text{a.} & \text{Merge sort} & \text{i.} & \te...
0 votes
0 votes
4 answers
3
go_editor asked Jan 31, 2017
2,289 views
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case.$O(1...
2 votes
2 votes
7 answers
4
go_editor asked Jan 31, 2017
7,520 views
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$