To meet this assessment you will need to:

Be able to trace breadth-first and depth-first search algorithms and describe typical applications of both.

Breadth-first: shortest path for an unweighted graph.

Depth-first: Navigating a maze.