From last years exam:
Given the following search tree, state the order in which the nodes will be searched for breadth and depth first search, until a solution is reached. (Ignore the numbers on the nodes for now).
One I've just made up:
Briefly discuss the advantages and disadvantages of depth and
breadth first search. What sort of problem is each appropriate for?
Another I've just made up:
Why might you choose to search from the goal state back to the initial state?
Yet another:
How does the use of a closed node list reduce the amount of search required in graph search.