Assess students' ability to apply breadth-first search (BFS) and depth-first search (DFS) on unweighted graphs to perform pathfinding (shortest path by edge count), determine connectivity/connected components, and detect cycles; tasks include tracing algorithm steps on small graphs, choosing traversal orders, using BFS for minimum-edge paths, using DFS/back-edge reasoning for cycle detection, interpreting adjacency lists/matrices, and explaining time/space complexity.