2025 Term 2 · Forenoon
27 questions from 25T2_fn.yaml. Answer everything, then hit "Check answers".
What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z
What is the path found by A* search algorithm? Enter the path as a comma separated list of node labels.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z
What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma separated list of node labels.
Use the Branch-and-Bound variation that avoids cyclic expansions like S,E,S,E,S,E,...
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z
For the given map, which algorithm finds the shortest path from S to G?
Select the correct statement(s) about the given graph.