Skip to content
Related Articles

Related Articles

Improve Article

UGC-NET | UGC NET CS 2017 Jan – III | Question 35

  • Last Updated : 04 Apr, 2018

Dijkstra’s algorithm is based on
(A) Divide and conquer paradigm
(B) Dynamic programming
(C) Greedy Approach
(D) Backtracking paradigm


Answer: (C)

Explanation:
Dijkstra’s algorithm is based on Greedy Approach.
For more information Refer:Greedy Algorithms | Set 7 (Dijkstra’s shortest path algorithm)
Option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :