retagged by
1,126 views
0 votes
0 votes

Dijkstra’s algorithm is based on

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

2 Answers

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.

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.
Answer:

Related questions

2 votes
2 votes
2 answers
1
admin asked Mar 31, 2020
8,498 views
The Knapsack problem belongs to which domain of problems?OptimizationNP completeLinear SolutionSorting
1 votes
1 votes
1 answer
2
Arjun asked Dec 7, 2018
16,949 views
______ sorting algorithms has the lowest worst-case complexity.Selection SortBubble SortMerge SortQuick Sort
0 votes
0 votes
3 answers
3
Arjun asked Dec 7, 2018
1,556 views
For the given recurrence equation$\begin{array} T(n) & =2T(n-1), &\text{if } n>0 \\ & =1, & \text{otherwise} \end{array}$$O(n \log n)$$O(n^2)$$O(2^n)$$O(n)$
0 votes
0 votes
1 answer
4
go_editor asked Mar 27, 2020
2,318 views
Binary search tree is an example of :Divide and conquer techniqueGreedy algorithmBack trackingDynamic Programming