2024 Term 1 · Forenoon
25 questions from 24T1_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,A,S,A,S,A,…
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?
What can you say about the heuristic function for the given graph?