Exploring Pathfinding Algorithms Quiz

Which of the following algorithms is used to find the shortest path in a graph with non-negative edge weights?

• Breadth-First Search

• Dijkstra's Algorithm

• Depth-First Search

• Heuristic Search

In the A* pathfinding algorithm, what is the purpose of the heuristic function?

• To calculate the exact cost from the start node to the goal

• To estimate the cost from the current node to the goal

• To determine the shortest path from the start node to the goal

• To explore all possible paths in the graph

Which graph traversal algorithm uses a queue data structure to explore nodes level by level?

• Depth-First Search

• A* Pathfinding Algorithm

• Breadth-First Search

• Dijkstra's Algorithm

What is the main difference between Depth-First Search (DFS) and Breadth-First Search (BFS)?

• DFS uses a queue, while BFS uses a stack

• DFS explores all neighbours before moving to the next level, while BFS explores one branch completely before backtracking

• DFS uses a stack, while BFS uses a queue

• DFS is used for weighted graphs, while BFS is used for unweighted graphs

In Dijkstra's Algorithm, what is the initial distance assigned to the start node?

• 0

• Infinity

• 1

• -1

Which of the following is a characteristic of heuristic search techniques?

• They guarantee finding the shortest path

• They do not use any additional information about the problem

• They use domain-specific knowledge to improve search efficiency

• They explore all possible paths exhaustively

Which of the following is true about the A* pathfinding algorithm?

• It always finds the longest path

• It is not guaranteed to find the shortest path

• It uses both actual cost and heuristic cost to find the shortest path

• It only works on unweighted graphs

In Depth-First Search, which data structure is typically used to keep track of the nodes to be explored?

• Queue

• Stack

• Priority Queue

• Linked List

Which of the following algorithms is most suitable for finding the shortest path in a graph with negative edge weights?

• Dijkstra's Algorithm

• A* Pathfinding Algorithm

• Bellman-Ford Algorithm

• Breadth-First Search