UTpaper

Free mock tests & test series

Question 47Asked in UGC NET Computer Science, June 2017 (Paper II & III, Selected Questions)

Dijkstra's algorithm is based on

  1. ADivide and conquer paradigm
  2. BDynamic programming
  3. CGreedy Approach
  4. DBacktracking paradigm
Show answerHide answer

Correct answer: (C) Greedy Approach

Explanation

Dijkstra's algorithm always chooses the closest vertex in V – S to add to the set S, where S is the set of vertices whose final shortest-path weights from the source are known. So it is a greedy algorithm.

From UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions)

This is question 47 of UGC NET Computer Science PYQ, June 2017 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.