Exploring Pathfinding Algorithms Quiz

What is the primary purpose of Dijkstra's Shortest Path algorithm?

• To find the longest path in a graph

• To find the shortest path between two nodes in a graph

• To sort nodes in a graph

• To detect cycles in a graph

Which data structure is commonly used to implement Dijkstra's algorithm efficiently?

• Stack

• Queue

• Priority Queue

• Linked List

In the context of A* Pathfinding, what does the heuristic function estimate?

• The total cost from the start node to the goal node

• The distance from the current node to the start node

• The distance from the current node to the goal node

• The number of nodes in the path

Which of the following is a key difference between Dijkstra's algorithm and A* Pathfinding?

• Dijkstra's algorithm uses a heuristic function, while A* does not

• A* Pathfinding uses a heuristic function, while Dijkstra's algorithm does not

• Dijkstra's algorithm is used for unweighted graphs, while A* is used for weighted graphs

• A* Pathfinding is used for unweighted graphs, while Dijkstra's is used for weighted graphs

• It calculates the total cost of the path from the start node to the goal node

• It calculates the cost of the path from the start node to the current node

• It calculates the estimated total cost from the start node to the goal node through the current node

• It calculates the number of nodes in the path

Which of the following is true about Dijkstra's algorithm?

• It can handle negative edge weights

• It cannot handle negative edge weights

• It is only applicable to directed graphs

• It is only applicable to undirected graphs

What is the main advantage of A* Pathfinding over Dijkstra's algorithm?

• A* is faster because it uses a heuristic to guide the search

• A* is more accurate because it considers all possible paths

• A* is simpler to implement

• A* can handle negative edge weights

Which of the following is a common heuristic used in A* Pathfinding for a grid-based map?

• Manhattan distance

• Euclidean distance

• Chebyshev distance

• All of the above

What is the primary limitation of Dijkstra's algorithm?

• It cannot find the shortest path

• It is not optimal for large graphs

• It cannot handle graphs with cycles

• It cannot handle graphs with negative edge weights

• The algorithm will still find the shortest path

• The algorithm may not find the shortest path

• The algorithm will run faster

• The algorithm will not terminate