Q. In which scenario is Dijkstra's algorithm most effectively applied?
-
A.
Finding the shortest path in an unweighted graph
-
B.
Finding the shortest path in a weighted graph with non-negative weights
-
C.
Finding the longest path in a graph
-
D.
Finding a cycle in a graph
Solution
Dijkstra's algorithm is most effective in finding the shortest path in a weighted graph where all edge weights are non-negative.
Correct Answer:
B
— Finding the shortest path in a weighted graph with non-negative weights
Learn More →
Q. What data structure is commonly used to implement Dijkstra's algorithm?
-
A.
Array
-
B.
Stack
-
C.
Priority Queue
-
D.
Linked List
Solution
A priority queue is commonly used in Dijkstra's algorithm to efficiently retrieve the next node with the smallest tentative distance.
Correct Answer:
C
— Priority Queue
Learn More →
Q. Which algorithm can be used instead of Dijkstra's algorithm for graphs with negative weights?
-
A.
A* Search Algorithm
-
B.
Bellman-Ford Algorithm
-
C.
Floyd-Warshall Algorithm
-
D.
Depth-First Search
Solution
The Bellman-Ford algorithm can be used for graphs with negative weights, as it can correctly find the shortest paths even in such cases.
Correct Answer:
B
— Bellman-Ford Algorithm
Learn More →
Showing 1 to 3 of 3 (1 Pages)
