0 votes 0 votes Dijkstra’s algorithm is based on Greedy approach Dynamic programming Backtracking paradigm Divide and conquer paradigm Algorithms nielit-2018 algorithms algorithm-design-technique + – Arjun asked Dec 7, 2018 • retagged Jun 3, 2022 by Arjun Arjun 1.2k views answer comment Share Follow See 1 comment See all 1 1 comment reply Lakshman Bhaiya commented Dec 7, 2018 reply Follow Share Dijkstra’s shortest path algorithm is based on Greedy approach. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes FRACTIONAL KNAPSACK JOB SEQUENCING WITH DEADLINES OPTIMAL MERGE PATTERN HUFFMAN CODING PRIMS & KRUSKALS MST DIJKSTRA'S ALGORITHM All these are based on GREEDY METHOD. So option A is correct. Asim Siddiqui 4 answered Feb 18, 2019 Asim Siddiqui 4 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes → Dijkstra's algorithm is following greedy approach. It always selects shortest path among all possibilities. → Dijkstra’s algorithm is solving the problem of single source shortest path. topper98 answered Mar 18, 2020 topper98 comment Share Follow See all 0 reply Please log in or register to add a comment.