Dijkstra's and A* Pathfinding Quiz

What is the primary purpose of Dijkstra's algorithm?

• To find the longest path in a graph

• To find the shortest path 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 Dijkstra's algorithm, what is the initial distance assigned to the starting node?

• 0

• 1

• Infinity

• -1

What is the main difference between Dijkstra's algorithm and A* algorithm?

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

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

• Dijkstra's is used for undirected graphs, A* for directed graphs

• A* is used for undirected graphs, Dijkstra's for directed graphs

Which of the following is a common heuristic used in the A* algorithm?

• Manhattan distance

• Euclidean distance

• Both A and B

• None of the above

What is the time complexity of Dijkstra's algorithm when implemented with a priority queue?

• The total cost from the start node to the goal

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 unweighted graphs

• It is only applicable to weighted graphs with positive weights

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

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

• A* is more accurate

• A* can handle negative weights

• A* is simpler to implement

• The number of nodes expanded