Test students' ability to analyze time–space trade-offs and correctness of Dijkstra, Bellman–Ford, and A* across graph types and heuristic choices. Assess understanding of algorithmic time and memory complexity in sparse vs. dense, directed vs. undirected graphs; correctness conditions (nonnegative edges, negative weights and cycles); how heuristic admissibility and consistency affect A* optimality and explored state space; and require selecting or designing the most appropriate algorithm/heuristic for given scenarios with justification and counterexamples.