Question

Dijkstra's algorithm, used for finding the shortest paths from a single source to all other vertices in a graph with non-negative edge weights, is an example of which algorithmic paradigm?

Q: Answer-Dijkstra's algorithm, used for finding the shortest paths from a single source to all other vertices...

Dijkstras algorithm is a greedy algorithm. At each step, it selects the unvisited vertex with the smallest known distance from the source and marks it as visited, then updates the distances of its neighbors. This locally optimal choice picking the closest unvisited vertex leads to a globally optimal solution for shortest paths in graphs with non-negative edge weights.