Q119
Dijkstra's Algorithm is the prime example for . . . . . . . .
A.
Greedy algorithm
AnswerB.
Branch and bound
C.
Back tracking
D.
Dynamic programming
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board